Generating journey flow visualization with node placement based on shortest distance to journey start

ABSTRACT

Systems, methods, and computer-readable media are disclosed for generating and providing journey flow visualizations. In one computer-implemented embodiments, a data intake and query system can be used to generate and provide journey flow visualizations. In operation, a set of journey instances associated with a journey having a set of steps is obtained. Thereafter, a journey flow visualization that represents flow paths for the set of journey instances is generated, for example, by a data intake and query system. The generation of the journey flow visualization includes, for each node representing a corresponding step of the journey, determining a flow level based on a shortest distance among the set of journey instances between the corresponding step and a journey start. The generation of the journey flow visualization further includes, for each node, determining an in-level position within the flow level based on positions of nodes in a higher flow level. Thereafter, the journey flow visualization can be presented to represent flow paths for the set of journey instances by a computing device via a graphical user interface.

FIELD

At least one embodiment of the present disclosure pertains to one ormore tools for facilitating searching and analyzing large sets of datato locate data of interest.

BACKGROUND

Information technology (IT) environments can include diverse types ofdata systems that store large amounts of diverse data types generated bynumerous devices. For example, a big data ecosystem may includedatabases such as MySQL and Oracle databases, cloud computing servicessuch as Amazon web services (AWS), and other data systems that storepassively or actively generated data, including machine-generated data(“machine data”). The machine data can include performance data,diagnostic data, or any other data that can be analyzed to diagnoseequipment performance problems, monitor user interactions, and to deriveother insights.

The large amount and diversity of data systems containing large amountsof structured, semi-structured, and unstructured data relevant to anysearch query can be massive, and continues to grow rapidly. Thistechnological evolution can give rise to various challenges in relationto managing, understanding and effectively utilizing the data. To reducethe potentially vast amount of data that may be generated, some datasystems pre-process data based on anticipated data analysis needs. Inparticular, specified data items may be extracted from the generateddata and stored in a data system to facilitate efficient retrieval andanalysis of those data items at a later time. At least some of theremainder of the generated data is typically discarded duringpre-processing.

However, storing massive quantities of minimally processed orunprocessed data (collectively and individually referred to as “rawdata”) for later retrieval and analysis is becoming increasingly morefeasible as storage capacity becomes more inexpensive and plentiful. Ingeneral, storing raw data and performing analysis on that data later canprovide greater flexibility because it enables an analyst to analyze allof the generated data instead of only a fraction of it.

Although the availability of vastly greater amounts of diverse data ondiverse data systems provides opportunities to derive new insights, italso gives rise to technical challenges to search and analyze the data.Tools exist that allow an analyst to search data systems separately andcollect results over a network for the analyst to derive insights in apiecemeal manner. However, UI tools that allow analysts to quicklysearch and analyze large set of raw machine data to visually identifydata subsets of interest, particularly via straightforward andeasy-to-understand sets of tools and search functionality do not exist.

BRIEF DESCRIPTION OF THE DRAWINGS

The present disclosure is illustrated by way of example, and notlimitation, in the figures of the accompanying drawings, in which likereference numerals indicate similar elements and in which:

FIG. 1 is a block diagram of an example networked computer environment,in accordance with example embodiments;

FIG. 2 is a block diagram of an example data intake and query system, inaccordance with example embodiments;

FIG. 3 is a block diagram of an example cloud-based data intake andquery system, in accordance with example embodiments;

FIG. 4 is a block diagram of an example data intake and query systemthat performs searches across external data systems, in accordance withexample embodiments;

FIG. 5A is a flowchart of an example method that illustrates howindexers process, index, and store data received from forwarders, inaccordance with example embodiments;

FIG. 5B is a block diagram of a data structure in which time-stampedevent data can be stored in a data store, in accordance with exampleembodiments;

FIG. 5C provides a visual representation of the manner in which apipelined search language or query operates, in accordance with exampleembodiments;

FIG. 6A is a flow diagram of an example method that illustrates how asearch head and indexers perform a search query, in accordance withexample embodiments;

FIG. 6B provides a visual representation of an example manner in which apipelined command language or query operates, in accordance with exampleembodiments;

FIG. 7A is a diagram of an example scenario where a common customeridentifier is found among log data received from three disparate datasources, in accordance with example embodiments;

FIG. 7B illustrates an example of processing keyword searches and fieldsearches, in accordance with disclosed embodiments;

FIG. 7C illustrates an example of creating and using an inverted index,in accordance with example embodiments;

FIG. 7D depicts a flowchart of example use of an inverted index in apipelined search query, in accordance with example embodiments;

FIG. 8A is an interface diagram of an example user interface for asearch screen, in accordance with example embodiments;

FIG. 8B is an interface diagram of an example user interface for a datasummary dialog that enables a user to select various data sources, inaccordance with example embodiments;

FIGS. 9-15 are interface diagrams of example report generation userinterfaces, in accordance with example embodiments;

FIG. 16 is an example search query received from a client and executedby search peers, in accordance with example embodiments;

FIG. 17A is an interface diagram of an example user interface of a keyindicators view, in accordance with example embodiments;

FIG. 17B is an interface diagram of an example user interface of anincident review dashboard, in accordance with example embodiments;

FIG. 17C is a tree diagram of an example a proactive monitoring tree, inaccordance with example embodiments;

FIG. 17D is an interface diagram of an example a user interfacedisplaying both log data and performance data, in accordance withexample embodiments;

FIG. 18 illustrates an example user interface displaying a user journey;

FIG. 19 illustrates an example process for creating a user journey;

FIG. 20 illustrates an example user interface for mapping a fieldidentifier in a particular data source;

FIG. 21 illustrates another example user interface for mapping a fieldidentifier in a particular data source;

FIG. 22 illustrates an example user interface for specifying informationthat is to be recorded for a particular step;

FIG. 23 illustrates a user interface for selecting steps to be includedin a user journey;

FIG. 24 illustrates an example user interface for specifyingcorrelations between data sources selected for a user journey;

FIG. 25 is a user interface illustrating a first example stitchingscheme;

FIG. 26 is a user interface illustrating a second example stitchingscheme;

FIG. 27 is a user interface illustrating a third example stitchingscheme;

FIG. 28 illustrates a representation of steps included in a userjourney;

FIG. 29 is a flowchart of an example process for presenting resultsassociated with a user journey;

FIG. 30 is a flowchart of another example process for presenting resultsassociated with a user journey;

FIG. 31 illustrates an example user interface that includes a userjourney and information indicating clusters associated with the userjourney;

FIG. 32 illustrates an example user interface presenting summaryinformation associated with a user journey;

FIG. 33 illustrates another example user interface presenting summaryinformation associated with a user journey;

FIG. 34 illustrates an example user interface presenting a nested userjourney included in a user journey;

FIG. 35 illustrates an example user interface indicating a path aparticular entity took through steps included in a user journey;

FIG. 36 illustrates an example user interface presenting touchpointsassociated with a particular entity;

FIG. 37 is an example flow diagram for generating a journey instance(s),in accordance with embodiments of the present invention;

FIG. 38 illustrates an example user interface for inputting a pivotidentifier(s) and/or a step identifier(s), in accordance withembodiments of the present invention;

FIG. 39 in an example flow diagram for analyzing journey instances, inaccordance with embodiments of the present invention;

FIG. 40 is an example user interface illustrating a journey flowvisualization, in accordance with embodiments of the present invention;

FIG. 41 is a flow diagram illustrating an embodiment of a routine forgenerating journey flow visualizations;

FIG. 42 is another flow diagram illustrating an embodiment of a routinefor generating journey flow visualizations;

FIG. 43 is an example user interface illustrating another journey flowvisualization;

FIG. 44 is an example user interface illustrating a journey flowvisualization including a journey step count;

FIG. 45 is an example user interface illustrating a journey flowvisualization including a path average duration; and

FIG. 46 is an example user interface illustrating a journey flowvisualization including a path count.

DETAILED DESCRIPTION

Embodiments are described herein according to the following outline:

-   1.0. General Overview-   2.0. Operating Environment    -   2.1. Host Devices    -   2.2. Client Devices    -   2.3. Client Device Applications    -   2.4. Data Server System    -   2.5 Cloud-Based System Overview    -   2.6 Searching Externally-Archived Data        -   2.6.1. ERP Process Features    -   2.7. Data Ingestion        -   2.7.1. Input        -   2.7.2. Parsing        -   2.7.3. Indexing    -   2.8. Query Processing    -   2.9. Pipelined Search Language    -   2.10. Field Extraction    -   2.11. Example Search Screen    -   2.12. Data Modeling    -   2.13. Acceleration Techniques        -   2.13.1. Aggregation Technique        -   2.13.2. Keyword Index        -   2.13.3. High Performance Analytics Store            -   2.13.3.1 Extracting Event Data Using Posting Values        -   2.13.4. Accelerating Report Generation    -   2.14. Security Features    -   2.15. Data Center Monitoring    -   2.16. IT Service Monitoring-   3.0 User Journeys    -   3.1 Generating and Analyzing Journey Instances    -   3.2 Generating and Providing Journey Flow Visualizations

In this description, references to “an embodiment,” “one embodiment,” orthe like, mean that the particular feature, function, structure orcharacteristic being described is included in at least one embodiment ofthe technique introduced herein. Occurrences of such phrases in thisspecification do not necessarily all refer to the same embodiment. Onthe other hand, the embodiments referred to are also not necessarilymutually exclusive.

A data intake and query system can index and store data in data storesof indexers, and can receive search queries causing a search of theindexers to obtain search results. The data intake and query systemtypically has search, extraction, execution, and analytics capabilitiesthat may be limited in scope to the data stores of the indexers(“internal data stores”). Hence, a seamless and comprehensive search andanalysis that includes diverse data types from external data sources,common storage (may also be referred to as global data storage or globaldata stores), ingested data buffers, query acceleration data stores,etc. may be difficult. Thus, the capabilities of some data intake andquery systems remain isolated from a variety of data sources that couldimprove search results to provide new insights. Furthermore, theprocessing flow of some data intake and query systems are unidirectionalin that data is obtained from a data source, processed, and thencommunicated to a search head or client without the ability to routedata to different destinations.

The disclosed embodiments overcome these drawbacks by extending thesearch and analytics capabilities of a data intake and query system toinclude diverse data types stored in diverse data systems internal to orexternal from the data intake and query system. As a result, an analystcan use the data intake and query system to search and analyze data froma wide variety of dataset sources, including enterprise systems and opensource technologies of a big data ecosystem. The term “big data” refersto large data sets that may be analyzed computationally to revealpatterns, trends, and associations, in some cases, relating to humanbehavior and interactions.

In particular, introduced herein is a data intake and query system thatthat has the ability to execute big data analytics seamlessly and canscale across diverse data sources to enable processing large volumes ofdiverse data from diverse data systems. A “data source” can include a“data system,” which may refer to a system that can process and/or storedata. A “data storage system” may refer to a storage system that canstore data such as unstructured, semi-structured, or structured data.Accordingly, a data source can include a data system that includes adata storage system.

The system can improve search and analytics capabilities of previoussystems by employing a search process master and query coordinatorscombined with a scalable network of distributed nodes communicativelycoupled to diverse data systems. The network of distributed nodes canact as agents of the data intake and query system to collect and processdata of distributed data systems, and the search process master andcoordinators can provide the processed data to the search head as searchresults.

For example, the data intake and query system can respond to a query byexecuting search operations on various internal and external datasources to obtain partial search results that are harmonized andpresented as search results of the query. As such, the data intake andquery system can offload search and analytics operations to thedistributed nodes. Hence, the system enables search and analyticscapabilities that can extend beyond the data stored on indexers toinclude external data systems, common storage, query acceleration datastores, ingested data buffers, etc.

The system can provide big data open stack integration to act as a bigdata pipeline that extends the search and analytics capabilities of asystem over numerous and diverse data sources. For example, the systemcan extend the data execution scope of the data intake and query systemto include data residing in external data systems such as MySQL,PostgreSQL, and Oracle databases; NoSQL data stores like Cassandra,Mongo DB; cloud storage like Amazon S3 and Hadoop distributed filesystem (HDFS); common storage; ingested data buffers; etc. Thus, thesystem can execute search and analytics operations for all possiblecombinations of data types stored in various data sources.

The distributed processing of the system enables scalability to includeany number of distributed data systems. As such, queries received by thedata intake and query system can be propagated to the network ofdistributed nodes to extend the search and analytics capabilities of thedata intake and query system over different data sources. In thiscontext, the network of distributed nodes can act as an extension of thelocal data intake in query system’s data processing pipeline tofacilitate scalable analytics across the diverse data systems.Accordingly, the system can extend and transform the data intake andquery system to include data resources into a data fabric platform thatcan leverage computing assets from anywhere and access and execute ondata regardless of type or origin.

The disclosed embodiments include services such as new searchcapabilities, visualization tools, and other services that areseamlessly integrated into the DFS system. For example, the disclosedtechniques include new search services performed on internal datastores, external data stores, or a combination of both. The searchoperations can provide ordered or unordered search results, or searchresults derived from data of diverse data systems, which can bevisualized to provide new and useful insights about the data containedin a big data ecosystem.

Various other features of the DFS system introduced here will becomeapparent from the description that follows. First, however, it is usefulto consider an example of an environment and system in which thetechniques can be employed, as will now be described.

1.0. General Overview

Modern data centers and other computing environments can compriseanywhere from a few host computer systems to thousands of systemsconfigured to process data, service requests from remote clients, andperform numerous other computational tasks. During operation, variouscomponents within these computing environments often generatesignificant volumes of machine data. Machine data is any data producedby a machine or component in an information technology (IT) environmentand that reflects activity in the IT environment. For example, machinedata can be raw machine data that is generated by various components inIT environments, such as servers, sensors, routers, mobile devices,Internet of Things (IoT) devices, etc. Machine data can include systemlogs, network packet data, sensor data, application program data, errorlogs, stack traces, system performance data, etc. In general, machinedata can also include performance data, diagnostic information, and manyother types of data that can be analyzed to diagnose performanceproblems, monitor user interactions, and to derive other insights.

A number of tools are available to analyze machine data. In order toreduce the size of the potentially vast amount of machine data that maybe generated, many of these tools typically pre-process the data basedon anticipated data-analysis needs. For example, pre-specified dataitems may be extracted from the machine data and stored in a database tofacilitate efficient retrieval and analysis of those data items atsearch time. However, the rest of the machine data typically is notsaved and is discarded during pre-processing. As storage capacitybecomes progressively cheaper and more plentiful, there are fewerincentives to discard these portions of machine data and many reasons toretain more of the data.

This plentiful storage capacity is presently making it feasible to storemassive quantities of minimally processed machine data for laterretrieval and analysis. In general, storing minimally processed machinedata and performing analysis operations at search time can providegreater flexibility because it enables an analyst to search all of themachine data, instead of searching only a pre-specified set of dataitems. This may enable an analyst to investigate different aspects ofthe machine data that previously were unavailable for analysis.

However, analyzing and searching massive quantities of machine datapresents a number of challenges. For example, a data center, servers, ornetwork appliances may generate many different types and formats ofmachine data (e.g., system logs, network packet data (e.g., wire data,etc.), sensor data, application program data, error logs, stack traces,system performance data, operating system data, virtualization data,etc.) from thousands of different components, which can collectively bevery time-consuming to analyze. In another example, mobile devices maygenerate large amounts of information relating to data accesses,application performance, operating system performance, networkperformance, etc. There can be millions of mobile devices that reportthese types of information.

These challenges can be addressed by using an event-based data intakeand query system, such as the SPLUNK® ENTERPRISE system developed bySplunk Inc. of San Francisco, California. The SPLUNK® ENTERPRISE systemis the leading platform for providing real-time operational intelligencethat enables organizations to collect, index, and search machine datafrom various websites, applications, servers, networks, and mobiledevices that power their businesses. The data intake and query system isparticularly useful for analyzing data which is commonly found in systemlog files, network data, and other data input sources. Although many ofthe techniques described herein are explained with reference to a dataintake and query system similar to the SPLUNK® ENTERPRISE system, thesetechniques are also applicable to other types of data systems.

In the data intake and query system, machine data are collected andstored as “events”. An event comprises a portion of machine data and isassociated with a specific point in time. The portion of machine datamay reflect activity in an IT environment and may be produced by acomponent of that IT environment, where the events may be searched toprovide insight into the IT environment, thereby improving theperformance of components in the IT environment. Events may be derivedfrom “time series data,” where the time series data comprises a sequenceof data points (e.g., performance measurements from a computer system,etc.) that are associated with successive points in time. In general,each event has a portion of machine data that is associated with atimestamp that is derived from the portion of machine data in the event.A timestamp of an event may be determined through interpolation betweentemporally proximate events having known timestamps or may be determinedbased on other configurable rules for associating timestamps withevents.

In some instances, machine data can have a predefined format, where dataitems with specific data formats are stored at predefined locations inthe data. For example, the machine data may include data associated withfields in a database table. In other instances, machine data may nothave a predefined format (e.g., may not be at fixed, predefinedlocations), but may have repeatable (e.g., non-random) patterns. Thismeans that some machine data can comprise various data items ofdifferent data types that may be stored at different locations withinthe data. For example, when the data source is an operating system log,an event can include one or more lines from the operating system logcontaining machine data that includes different types of performance anddiagnostic information associated with a specific point in time (e.g., atimestamp).

Examples of components which may generate machine data from which eventscan be derived include, but are not limited to, web servers, applicationservers, databases, firewalls, routers, operating systems, and softwareapplications that execute on computer systems, mobile devices, sensors,Internet of Things (IoT) devices, etc. The machine data generated bysuch data sources can include, for example and without limitation,server log files, activity log files, configuration files, messages,network packet data, performance measurements, sensor measurements, etc.

The data intake and query system uses a flexible schema to specify howto extract information from events. A flexible schema may be developedand redefined as needed. Note that a flexible schema may be applied toevents “on the fly,” when it is needed (e.g., at search time, indextime, ingestion time, etc.). When the schema is not applied to eventsuntil search time, the schema may be referred to as a “late-bindingschema.”

During operation, the data intake and query system receives machine datafrom any type and number of sources (e.g., one or more system logs,streams of network packet data, sensor data, application program data,error logs, stack traces, system performance data, etc.). The systemparses the machine data to produce events each having a portion ofmachine data associated with a timestamp. The system stores the eventsin a data store. The system enables users to run queries against thestored events to, for example, retrieve events that meet criteriaspecified in a query, such as criteria indicating certain keywords orhaving specific values in defined fields. As used herein, the term“field” refers to a location in the machine data of an event containingone or more values for a specific data item. A field may be referencedby a field name associated with the field. As will be described in moredetail herein, a field is defined by an extraction rule (e.g., a regularexpression) that derives one or more values or a sub-portion of textfrom the portion of machine data in each event to produce a value forthe field for that event. The set of values produced aresemantically-related (such as IP address), even though the machine datain each event may be in different formats (e.g., semantically-relatedvalues may be in different positions in the events derived fromdifferent sources).

As described above, the system stores the events in a data store. Theevents stored in the data store are field-searchable, wherefield-searchable herein refers to the ability to search the machine data(e.g., the raw machine data) of an event based on a field specified insearch criteria. For example, a search having criteria that specifies afield name “UserID” may cause the system to field-search the machinedata of events to identify events that have the field name “UserID.” Inanother example, a search having criteria that specifies a field name“UserID” with a corresponding field value “12345” may cause the systemto field-search the machine data of events to identify events havingthat field-value pair (e.g., field name “UserID” with a correspondingfield value of “12345”). Events are field-searchable using one or moreconfiguration files associated with the events. Each configuration fileincludes one or more field names, where each field name is associatedwith a corresponding extraction rule and a set of events to which thatextraction rule applies. The set of events to which an extraction ruleapplies may be identified by metadata associated with the set of events.For example, an extraction rule may apply to a set of events that areeach associated with a particular host, source, or source type. Whenevents are to be searched based on a particular field name specified ina search, the system uses one or more configuration files to determinewhether there is an extraction rule for that particular field name thatapplies to each event that falls within the criteria of the search. Ifso, the event is considered as part of the search results (andadditional processing may be performed on that event based on criteriaspecified in the search). If not, the next event is similarly analyzed,and so on.

As noted above, the data intake and query system utilizes a late-bindingschema while performing queries on events. One aspect of a late-bindingschema is applying extraction rules to events to extract values forspecific fields during search time. More specifically, the extractionrule for a field can include one or more instructions that specify howto extract a value for the field from an event. An extraction rule cangenerally include any type of instruction for extracting values fromevents. In some cases, an extraction rule comprises a regularexpression, where a sequence of characters form a search pattern. Anextraction rule comprising a regular expression is referred to herein asa regex rule. The system applies a regex rule to an event to extractvalues for a field associated with the regex rule, where the values areextracted by searching the event for the sequence of characters definedin the regex rule.

In the data intake and query system, a field extractor may be configuredto automatically generate extraction rules for certain fields in theevents when the events are being created, indexed, or stored, orpossibly at a later time. Alternatively, a user may manually defineextraction rules for fields using a variety of techniques. In contrastto a conventional schema for a database system, a late-binding schema isnot defined at data ingestion time. Instead, the late-binding schema canbe developed on an ongoing basis until the time a query is actuallyexecuted. This means that extraction rules for the fields specified in aquery may be provided in the query itself, or may be located duringexecution of the query. Hence, as a user learns more about the data inthe events, the user can continue to refine the late-binding schema byadding new fields, deleting fields, or modifying the field extractionrules for use the next time the schema is used by the system. Becausethe data intake and query system maintains the underlying machine dataand uses a late-binding schema for searching the machine data, itenables a user to continue investigating and learn valuable insightsabout the machine data.

In some embodiments, a common field name may be used to reference two ormore fields containing equivalent and/or similar data items, even thoughthe fields may be associated with different types of events thatpossibly have different data formats and different extraction rules. Byenabling a common field name to be used to identify equivalent and/orsimilar fields from different types of events generated by disparatedata sources, the system facilitates use of a “common information model”(CIM) across the disparate data sources (further discussed with respectto FIG. 7A).

2.0. Operating Environment

FIG. 1 is a block diagram of an example networked computer environment100, in accordance with example embodiments. Those skilled in the artwould understand that FIG. 1 represents one example of a networkedcomputer system and other embodiments may use different arrangements.

The networked computer system 100 comprises one or more computingdevices. These one or more computing devices comprise any combination ofhardware and software configured to implement the various logicalcomponents described herein. For example, the one or more computingdevices may include one or more memories that store instructions forimplementing the various components described herein, one or morehardware processors configured to execute the instructions stored in theone or more memories, and various data repositories in the one or morememories for storing data structures utilized and manipulated by thevarious components.

In some embodiments, one or more client devices 102 are coupled to oneor more host devices 106 and a data intake and query system 108 via oneor more networks 104. Networks 104 broadly represent one or more LANs,WANs, cellular networks (e.g., LTE, HSPA, 3G, and other cellulartechnologies), and/or networks using any of wired, wireless, terrestrialmicrowave, or satellite links, and may include the public Internet.

2.1. Host Devices

In the illustrated embodiment, a system 100 includes one or more hostdevices 106. Host devices 106 may broadly include any number ofcomputers, virtual machine instances, and/or data centers that areconfigured to host or execute one or more instances of host applications114. In general, a host device 106 may be involved, directly orindirectly, in processing requests received from client devices 102.Each host device 106 may comprise, for example, one or more of a networkdevice, a web server, an application server, a database server, etc. Acollection of host devices 106 may be configured to implement anetwork-based service. For example, a provider of a network-basedservice may configure one or more host devices 106 and host applications114 (e.g., one or more web servers, application servers, databaseservers, etc.) to collectively implement the network-based application.

In general, client devices 102 communicate with one or more hostapplications 114 to exchange information. The communication between aclient device 102 and a host application 114 may, for example, be basedon the Hypertext Transfer Protocol (HTTP) or any other network protocol.Content delivered from the host application 114 to a client device 102may include, for example, HTML documents, media content, etc. Thecommunication between a client device 102 and host application 114 mayinclude sending various requests and receiving data packets. Forexample, in general, a client device 102 or application running on aclient device may initiate communication with a host application 114 bymaking a request for a specific resource (e.g., based on an HTTPrequest), and the application server may respond with the requestedcontent stored in one or more response packets.

In the illustrated embodiment, one or more of host applications 114 maygenerate various types of performance data during operation, includingevent logs, network data, sensor data, and other types of machine data.For example, a host application 114 comprising a web server may generateone or more web server logs in which details of interactions between theweb server and any number of client devices 102 is recorded. As anotherexample, a host device 106 comprising a router may generate one or morerouter logs that record information related to network traffic managedby the router. As yet another example, a host application 114 comprisinga database server may generate one or more logs that record informationrelated to requests sent from other host applications 114 (e.g., webservers or application servers) for data managed by the database server.

2.2. Client Devices

Client devices 102 of FIG. 1 represent any computing device capable ofinteracting with one or more host devices 106 via a network 104.Examples of client devices 102 may include, without limitation, smartphones, tablet computers, handheld computers, wearable devices, laptopcomputers, desktop computers, servers, portable media players, gamingdevices, and so forth. In general, a client device 102 can provideaccess to different content, for instance, content provided by one ormore host devices 106, etc. Each client device 102 may comprise one ormore client applications 110, described in more detail in a separatesection hereinafter.

2.3. Client Device Applications

In some embodiments, each client device 102 may host or execute one ormore client applications 110 that are capable of interacting with one ormore host devices 106 via one or more networks 104. For instance, aclient application 110 may be or comprise a web browser that a user mayuse to navigate to one or more websites or other resources provided byone or more host devices 106. As another example, a client application110 may comprise a mobile application or “app.” For example, an operatorof a network-based service hosted by one or more host devices 106 maymake available one or more mobile apps that enable users of clientdevices 102 to access various resources of the network-based service. Asyet another example, client applications 110 may include backgroundprocesses that perform various operations without direct interactionfrom a user. A client application 110 may include a “plug-in” or“extension” to another application, such as a web browser plug-in orextension.

In some embodiments, a client application 110 may include a monitoringcomponent 112. At a high level, the monitoring component 112 comprises asoftware component or other logic that facilitates generatingperformance data related to a client device’s operating state, includingmonitoring network traffic sent and received from the client device andcollecting other device and/or application-specific information.Monitoring component 112 may be an integrated component of a clientapplication 110, a plug-in, an extension, or any other type of add-oncomponent. Monitoring component 112 may also be a stand-alone process.

In some embodiments, a monitoring component 112 may be created when aclient application 110 is developed, for example, by an applicationdeveloper using a software development kit (SDK). The SDK may includecustom monitoring code that can be incorporated into the codeimplementing a client application 110. When the code is converted to anexecutable application, the custom code implementing the monitoringfunctionality can become part of the application itself.

In some embodiments, an SDK or other code for implementing themonitoring functionality may be offered by a provider of a data intakeand query system, such as a system 108. In such cases, the provider ofthe system 108 can implement the custom code so that performance datagenerated by the monitoring functionality is sent to the system 108 tofacilitate analysis of the performance data by a developer of the clientapplication or other users.

In some embodiments, the custom monitoring code may be incorporated intothe code of a client application 110 in a number of different ways, suchas the insertion of one or more lines in the client application codethat call or otherwise invoke the monitoring component 112. As such, adeveloper of a client application 110 can add one or more lines of codeinto the client application 110 to trigger the monitoring component 112at desired points during execution of the application. Code thattriggers the monitoring component may be referred to as a monitortrigger. For instance, a monitor trigger may be included at or near thebeginning of the executable code of the client application 110 such thatthe monitoring component 112 is initiated or triggered as theapplication is launched, or included at other points in the code thatcorrespond to various actions of the client application, such as sendinga network request or displaying a particular interface.

In some embodiments, the monitoring component 112 may monitor one ormore aspects of network traffic sent and/or received by a clientapplication 110. For example, the monitoring component 112 may beconfigured to monitor data packets transmitted to and/or from one ormore host applications 114. Incoming and/or outgoing data packets can beread or examined to identify network data contained within the packets,for example, and other aspects of data packets can be analyzed todetermine a number of network performance statistics. Monitoring networktraffic may enable information to be gathered particular to the networkperformance associated with a client application 110 or set ofapplications.

In some embodiments, network performance data refers to any type of datathat indicates information about the network and/or network performance.Network performance data may include, for instance, a URL requested, aconnection type (e.g., HTTP, HTTPS, etc.), a connection start time, aconnection end time, an HTTP status code, request length, responselength, request headers, response headers, connection status (e.g.,completion, response time(s), failure, etc.), and the like. Uponobtaining network performance data indicating performance of thenetwork, the network performance data can be transmitted to a dataintake and query system 108 for analysis.

Upon developing a client application 110 that incorporates a monitoringcomponent 112, the client application 110 can be distributed to clientdevices 102. Applications generally can be distributed to client devices102 in any manner, or they can be pre-loaded. In some cases, theapplication may be distributed to a client device 102 via an applicationmarketplace or other application distribution system. For instance, anapplication marketplace or other application distribution system mightdistribute the application to a client device based on a request fromthe client device to download the application.

Examples of functionality that enables monitoring performance of aclient device are described in U.S. Pat. Application No. 14/524,748,entitled “UTILIZING PACKET HEADERS TO MONITOR NETWORK TRAFFIC INASSOCIATION WITH A CLIENT DEVICE”, filed on 27 Oct. 2014, and which ishereby incorporated by reference in its entirety for all purposes.

In some embodiments, the monitoring component 112 may also monitor andcollect performance data related to one or more aspects of theoperational state of a client application 110 and/or client device 102.For example, a monitoring component 112 may be configured to collectdevice performance information by monitoring one or more client deviceoperations, or by making calls to an operating system and/or one or moreother applications executing on a client device 102 for performanceinformation. Device performance information may include, for instance, acurrent wireless signal strength of the device, a current connectiontype and network carrier, current memory performance information, ageographic location of the device, a device orientation, and any otherinformation related to the operational state of the client device.

In some embodiments, the monitoring component 112 may also monitor andcollect other device profile information including, for example, a typeof client device, a manufacturer and model of the device, versions ofvarious software applications installed on the device, and so forth.

In general, a monitoring component 112 may be configured to generateperformance data in response to a monitor trigger in the code of aclient application 110 or other triggering application event, asdescribed above, and to store the performance data in one or more datarecords. Each data record, for example, may include a collection offield-value pairs, each field-value pair storing a particular item ofperformance data in association with a field for the item. For example,a data record generated by a monitoring component 112 may include a“networkLatency” field (not shown in the Figure) in which a value isstored. This field indicates a network latency measurement associatedwith one or more network requests. The data record may include a “state”field to store a value indicating a state of a network connection, andso forth for any number of aspects of collected performance data.

2.4. Data Server System

FIG. 2 is a block diagram of an example data intake and query system108, in accordance with example embodiments. System 108 includes one ormore forwarders 204 that receive data from a variety of input datasources 202, and one or more indexers 206 that process and store thedata in one or more data stores 208. These forwarders 204 and indexers208 can comprise separate computer systems, or may alternativelycomprise separate processes executing on one or more computer systems.

Each data source 202 broadly represents a distinct source of data thatcan be consumed by system 108. Examples of a data sources 202 include,without limitation, data files, directories of files, data sent over anetwork, event logs, registries, etc.

During operation, the forwarders 204 identify which indexers 206 receivedata collected from a data source 202 and forward the data to theappropriate indexers. Forwarders 204 can also perform operations on thedata before forwarding, including removing extraneous data, detectingtimestamps in the data, parsing data, indexing data, routing data basedon criteria relating to the data being routed, and/or performing otherdata transformations.

In some embodiments, a forwarder 204 may comprise a service accessibleto client devices 102 and host devices 106 via a network 104. Forexample, one type of forwarder 204 may be capable of consuming vastamounts of real-time data from a potentially large number of clientdevices 102 and/or host devices 106. The forwarder 204 may, for example,comprise a computing device which implements multiple data pipelines or“queues” to handle forwarding of network data to indexers 206. Aforwarder 204 may also perform many of the functions that are performedby an indexer. For example, a forwarder 204 may perform keywordextractions on raw data or parse raw data to create events. A forwarder204 may generate time stamps for events. Additionally or alternatively,a forwarder 204 may perform routing of events to indexers 206. Datastore 208 may contain events derived from machine data from a variety ofsources all pertaining to the same component in an IT environment, andthis data may be produced by the machine in question or by othercomponents in the IT environment.

2.5. Cloud-Based System Overview

The example data intake and query system 108 described in reference toFIG. 2 comprises several system components, including one or moreforwarders, indexers, and search heads. In some environments, a user ofa data intake and query system 108 may install and configure, oncomputing devices owned and operated by the user, one or more softwareapplications that implement some or all of these system components. Forexample, a user may install a software application on server computersowned by the user and configure each server to operate as one or more ofa forwarder, an indexer, a search head, etc. This arrangement generallymay be referred to as an “on-premises” solution. That is, the system 108is installed and operates on computing devices directly controlled bythe user of the system. Some users may prefer an on-premises solutionbecause it may provide a greater level of control over the configurationof certain aspects of the system (e.g., security, privacy, standards,controls, etc.). However, other users may instead prefer an arrangementin which the user is not directly responsible for providing and managingthe computing devices upon which various components of system 108operate.

In one embodiment, to provide an alternative to an entirely on-premisesenvironment for system 108, one or more of the components of a dataintake and query system instead may be provided as a cloud-basedservice. In this context, a cloud-based service refers to a servicehosted by one more computing resources that are accessible to end usersover a network, for example, by using a web browser or other applicationon a client device to interface with the remote computing resources. Forexample, a service provider may provide a cloud-based data intake andquery system by managing computing resources configured to implementvarious aspects of the system (e.g., forwarders, indexers, search heads,etc.) and by providing access to the system to end users via a network.Typically, a user may pay a subscription or other fee to use such aservice. Each subscribing user of the cloud-based service may beprovided with an account that enables the user to configure a customizedcloud-based system based on the user’s preferences.

FIG. 3 illustrates a block diagram of an example cloud-based data intakeand query system. Similar to the system of FIG. 2 , the networkedcomputer system 300 includes input data sources 202 and forwarders 204.These input data sources and forwarders may be in a subscriber’s privatecomputing environment. Alternatively, they might be directly managed bythe service provider as part of the cloud service. In the example system300, one or more forwarders 204 and client devices 302 are coupled to acloud-based data intake and query system 306 via one or more networks304. Network 304 broadly represents one or more LANs, WANs, cellularnetworks, intranetworks, internetworks, etc., using any of wired,wireless, terrestrial microwave, satellite links, etc., and may includethe public Internet, and is used by client devices 302 and forwarders204 to access the system 306. Similar to the system of 38, each of theforwarders 204 may be configured to receive data from an input sourceand to forward the data to other components of the system 306 forfurther processing.

In some embodiments, a cloud-based data intake and query system 306 maycomprise a plurality of system instances 308. In general, each systeminstance 308 may include one or more computing resources managed by aprovider of the cloud-based system 306 made available to a particularsubscriber. The computing resources comprising a system instance 308may, for example, include one or more servers or other devicesconfigured to implement one or more forwarders, indexers, search heads,and other components of a data intake and query system, similar tosystem 108. As indicated above, a subscriber may use a web browser orother application of a client device 302 to access a web portal or otherinterface that enables the subscriber to configure an instance 308.

Providing a data intake and query system as described in reference tosystem 108 as a cloud-based service presents a number of challenges.Each of the components of a system 108 (e.g., forwarders, indexers, andsearch heads) may at times refer to various configuration files storedlocally at each component. These configuration files typically mayinvolve some level of user configuration to accommodate particular typesof data a user desires to analyze and to account for other userpreferences. However, in a cloud-based service context, users typicallymay not have direct access to the underlying computing resourcesimplementing the various system components (e.g., the computingresources comprising each system instance 308) and may desire to makesuch configurations indirectly, for example, using one or more web-basedinterfaces. Thus, the techniques and systems described herein forproviding user interfaces that enable a user to configure source typedefinitions are applicable to both on-premises and cloud-based servicecontexts, or some combination thereof (e.g., a hybrid system where bothan on-premises environment, such as SPLUNK® ENTERPRISE, and acloud-based environment, such as SPLUNK CLOUD™, are centrally visible).

2.6. Searching Externally-Archived Data

FIG. 4 shows a block diagram of an example of a data intake and querysystem 108 that provides transparent search facilities for data systemsthat are external to the data intake and query system. Such facilitiesare available in the Splunk® Analytics for Hadoop® system provided bySplunk Inc. of San Francisco, California. Splunk® Analytics for Hadoop®represents an analytics platform that enables business and IT teams torapidly explore, analyze, and visualize data in Hadoop® and NoSQL datastores.

The search head 210 of the data intake and query system receives searchrequests from one or more client devices 404 over network connections420. As discussed above, the data intake and query system 108 may residein an enterprise location, in the cloud, etc. FIG. 4 illustrates thatmultiple client devices 404 a, 404 b,.., 404 n may communicate with thedata intake and query system 108. The client devices 404 may communicatewith the data intake and query system using a variety of connections.For example, one client device in FIG. 4 is illustrated as communicatingover an Internet (Web) protocol, another client device is illustrated ascommunicating via a command line interface, and another client device isillustrated as communicating via a software developer kit (SDK).

The search head 210 analyzes the received search request to identifyrequest parameters. If a search request received from one of the clientdevices 404 references an index maintained by the data intake and querysystem, then the search head 210 connects to one or more indexers 206 ofthe data intake and query system for the index referenced in the requestparameters. That is, if the request parameters of the search requestreference an index, then the search head accesses the data in the indexvia the indexer. The data intake and query system 108 may include one ormore indexers 206, depending on system access resources andrequirements. As described further below, the indexers 206 retrieve datafrom their respective local data stores 208 as specified in the searchrequest. The indexers and their respective data stores can comprise oneor more storage devices and typically reside on the same system, thoughthey may be connected via a local network connection.

If the request parameters of the received search request reference anexternal data collection, which is not accessible to the indexers 206 orunder the management of the data intake and query system, then thesearch head 210 can access the external data collection through anExternal Result Provider (ERP) process 410. An external data collectionmay be referred to as a “virtual index” (plural, “virtual indices”). AnERP process provides an interface through which the search head 210 mayaccess virtual indices.

Thus, a search reference to an index of the system relates to a locallystored and managed data collection. In contrast, a search reference to avirtual index relates to an externally stored and managed datacollection, which the search head may access through one or more ERPprocesses 410, 412. FIG. 4 shows two ERP processes 410, 412 that connectto respective remote (external) virtual indices, which are indicated asa Hadoop or another system 414 (e.g., Amazon S3, Amazon EMR, otherHadoop® Compatible File Systems (HCFS), etc.) and a relational databasemanagement system (RDBMS) 416. Other virtual indices may include otherfile organizations and protocols, such as Structured Query Language(SQL) and the like. The ellipses between the ERP processes 410, 412indicate optional additional ERP processes of the data intake and querysystem 108. An ERP process may be a computer process that is initiatedor spawned by the search head 210 and is executed by the search dataintake and query system 108. Alternatively or additionally, an ERPprocess may be a process spawned by the search head 210 on the same ordifferent host system as the search head 210 resides.

The search head 210 may spawn a single ERP process in response tomultiple virtual indices referenced in a search request, or the searchhead may spawn different ERP processes for different virtual indices.Generally, virtual indices that share common data configurations orprotocols may share ERP processes. For example, all search queryreferences to a Hadoop file system may be processed by the same ERPprocess, if the ERP process is suitably configured. Likewise, all searchquery references to a SQL database may be processed by the same ERPprocess. In addition, the search head may provide a common ERP processfor common external data source types (e.g., a common vendor may utilizea common ERP process, even if the vendor includes different data storagesystem types, such as Hadoop and SQL). Common indexing schemes also maybe handled by common ERP processes, such as flat text files or Weblogfiles.

The search head 210 determines the number of ERP processes to beinitiated via the use of configuration parameters that are included in asearch request message. Generally, there is a one-to-many relationshipbetween an external results provider “family” and ERP processes. Thereis also a one-to-many relationship between an ERP process andcorresponding virtual indices that are referred to in a search request.For example, using RDBMS, assume two independent instances of such asystem by one vendor, such as one RDBMS for production and another RDBMSused for development. In such a situation, it is likely preferable (butoptional) to use two ERP processes to maintain the independent operationas between production and development data. Both of the ERPs, however,will belong to the same family, because the two RDBMS system types arefrom the same vendor.

The ERP processes 410, 412 receive a search request from the search head210. The search head may optimize the received search request forexecution at the respective external virtual index. Alternatively, theERP process may receive a search request as a result of analysisperformed by the search head or by a different system process. The ERPprocesses 410, 412 can communicate with the search head 210 viaconventional input/output routines (e.g., standard in / standard out,etc.). In this way, the ERP process receives the search request from aclient device such that the search request may be efficiently executedat the corresponding external virtual index.

The ERP processes 410, 412 may be implemented as a process of the dataintake and query system. Each ERP process may be provided by the dataintake and query system, or may be provided by process or applicationproviders who are independent of the data intake and query system. Eachrespective ERP process may include an interface application installed ata computer of the external result provider that ensures propercommunication between the search support system and the external resultprovider. The ERP processes 410, 412 generate appropriate searchrequests in the protocol and syntax of the respective virtual indices414, 416, each of which corresponds to the search request received bythe search head 210. Upon receiving search results from theircorresponding virtual indices, the respective ERP process passes theresult to the search head 210, which may return or display the resultsor a processed set of results based on the returned results to therespective client device.

Client devices 404 may communicate with the data intake and query system108 through a network interface 420, e.g., one or more LANs, WANs,cellular networks, intranetworks, and/or internetworks using any ofwired, wireless, terrestrial microwave, satellite links, etc., and mayinclude the public Internet.

The analytics platform utilizing the External Result Provider processdescribed in more detail in U.S. Pat. No. 8,738,629, entitled “EXTERNALRESULT PROVIDED PROCESS FOR RETRIEVING DATA STORED USING A DIFFERENTCONFIGURATION OR PROTOCOL”, issued on 27 May 2014, U.S. Pat. No.8,738,587, entitled “PROCESSING A SYSTEM SEARCH REQUEST BY RETRIEVINGRESULTS FROM BOTH A NATIVE INDEX AND A VIRTUAL INDEX”, issued on 25 Jul.2013, U.S. Pat. Application No. 14/266,832, entitled “PROCESSING ASYSTEM SEARCH REQUEST ACROSS DISPARATE DATA COLLECTION SYSTEMS”, filedon 1 May 2014, and U.S. Pat. No. 9,514,189, entitled “PROCESSING ASYSTEM SEARCH REQUEST INCLUDING EXTERNAL DATA SOURCES”, issued on 6 Dec.2016, each of which is hereby incorporated by reference in its entiretyfor all purposes.

2.6.1. ERP Process Features

The ERP processes described above may include two operation modes: astreaming mode and a reporting mode. The ERP processes can operate instreaming mode only, in reporting mode only, or in both modessimultaneously. Operating in both modes simultaneously is referred to asmixed mode operation. In a mixed mode operation, the ERP at some pointcan stop providing the search head with streaming results and onlyprovide reporting results thereafter, or the search head at some pointmay start ignoring streaming results it has been using and only usereporting results thereafter.

The streaming mode returns search results in real time, with minimalprocessing, in response to the search request. The reporting modeprovides results of a search request with processing of the searchresults prior to providing them to the requesting search head, which inturn provides results to the requesting client device. ERP operationwith such multiple modes provides greater performance flexibility withregard to report time, search latency, and resource utilization.

In a mixed mode operation, both streaming mode and reporting mode areoperating simultaneously. The streaming mode results (e.g., the machinedata obtained from the external data source) are provided to the searchhead, which can then process the results data (e.g., break the machinedata into events, timestamp it, filter it, etc.) and integrate theresults data with the results data from other external data sources,and/or from data stores of the search head. The search head performssuch processing and can immediately start returning interim (streamingmode) results to the user at the requesting client device;simultaneously, the search head is waiting for the ERP process toprocess the data it is retrieving from the external data source as aresult of the concurrently executing reporting mode.

In some instances, the ERP process initially operates in a mixed mode,such that the streaming mode operates to enable the ERP quickly toreturn interim results (e.g., some of the machined data or unprocesseddata necessary to respond to a search request) to the search head,enabling the search head to process the interim results and beginproviding to the client or search requester interim results that areresponsive to the query. Meanwhile, in this mixed mode, the ERP alsooperates concurrently in reporting mode, processing portions of machinedata in a manner responsive to the search query. Upon determining thatit has results from the reporting mode available to return to the searchhead, the ERP may halt processing in the mixed mode at that time (orsome later time) by stopping the return of data in streaming mode to thesearch head and switching to reporting mode only. The ERP at this pointstarts sending interim results in reporting mode to the search head,which in turn may then present this processed data responsive to thesearch request to the client or search requester. Typically the searchhead switches from using results from the ERP’s streaming mode ofoperation to results from the ERP’s reporting mode of operation when thehigher bandwidth results from the reporting mode outstrip the amount ofdata processed by the search head in the streaming mode of ERPoperation.

A reporting mode may have a higher bandwidth because the ERP does nothave to spend time transferring data to the search head for processingall the machine data. In addition, the ERP may optionally direct anotherprocessor to do the processing.

The streaming mode of operation does not need to be stopped to gain thehigher bandwidth benefits of a reporting mode; the search head couldsimply stop using the streaming mode results — and start using thereporting mode results — when the bandwidth of the reporting mode hascaught up with or exceeded the amount of bandwidth provided by thestreaming mode. Thus, a variety of triggers and ways to accomplish asearch head’s switch from using streaming mode results to usingreporting mode results may be appreciated by one skilled in the art.

The reporting mode can involve the ERP process (or an external system)performing event breaking, time stamping, filtering of events to matchthe search query request, and calculating statistics on the results. Theuser can request particular types of data, such as if the search queryitself involves types of events, or the search request may ask forstatistics on data, such as on events that meet the search request. Ineither case, the search head understands the query language used in thereceived query request, which may be a proprietary language. Oneexemplary query language is Splunk Processing Language (SPL) developedby the assignee of the application, Splunk Inc. The search headtypically understands how to use that language to obtain data from theindexers, which store data in a format used by the SPLUNK® Enterprisesystem.

The ERP processes support the search head, as the search head is notordinarily configured to understand the format in which data is storedin external data sources such as Hadoop or SQL data systems. Rather, theERP process performs that translation from the query submitted in thesearch support system’s native format (e.g., SPL if SPLUNK® ENTERPRISEis used as the search support system) to a search query request formatthat will be accepted by the corresponding external data system. Theexternal data system typically stores data in a different format fromthat of the search support system’s native index format, and it utilizesa different query language (e.g., SQL or MapReduce, rather than SPL orthe like).

As noted, the ERP process can operate in the streaming mode alone. Afterthe ERP process has performed the translation of the query request andreceived raw results from the streaming mode, the search head canintegrate the returned data with any data obtained from local datasources (e.g., native to the search support system), other external datasources, and other ERP processes (if such operations were required tosatisfy the terms of the search query). An advantage of mixed modeoperation is that, in addition to streaming mode, the ERP process isalso executing concurrently in reporting mode. Thus, the ERP process(rather than the search head) is processing query results (e.g.,performing event breaking, timestamping, filtering, possibly calculatingstatistics if required to be responsive to the search query request,etc.). It should be apparent to those skilled in the art that additionaltime is needed for the ERP process to perform the processing in such aconfiguration. Therefore, the streaming mode will allow the search headto start returning interim results to the user at the client devicebefore the ERP process can complete sufficient processing to startreturning any search results. The switchover between streaming andreporting mode happens when the ERP process determines that theswitchover is appropriate, such as when the ERP process determines itcan begin returning meaningful results from its reporting mode.

The operation described above illustrates the source of operationallatency: streaming mode has low latency (immediate results) and usuallyhas relatively low bandwidth (fewer results can be returned per unit oftime). In contrast, the concurrently running reporting mode hasrelatively high latency (it has to perform a lot more processing beforereturning any results) and usually has relatively high bandwidth (moreresults can be processed per unit of time). For example, when the ERPprocess does begin returning report results, it returns more processedresults than in the streaming mode, because, e.g., statistics only needto be calculated to be responsive to the search request. That is, theERP process doesn’t have to take time to first return machine data tothe search head. As noted, the ERP process could be configured tooperate in streaming mode alone and return just the machine data for thesearch head to process in a way that is responsive to the searchrequest. Alternatively, the ERP process can be configured to operate inthe reporting mode only. Also, the ERP process can be configured tooperate in streaming mode and reporting mode concurrently, as described,with the ERP process stopping the transmission of streaming results tothe search head when the concurrently running reporting mode has caughtup and started providing results. The reporting mode does not requirethe processing of all machine data that is responsive to the searchquery request before the ERP process starts returning results; rather,the reporting mode usually performs processing of chunks of events andreturns the processing results to the search head for each chunk.

For example, an ERP process can be configured to merely return thecontents of a search result file verbatim, with little or no processingof results. That way, the search head performs all processing (such asparsing byte streams into events, filtering, etc.). The ERP process canbe configured to perform additional intelligence, such as analyzing thesearch request and handling all the computation that a native searchindexer process would otherwise perform. In this way, the configured ERPprocess provides greater flexibility in features while operatingaccording to desired preferences, such as response latency and resourcerequirements.

2.7. Data Ingestion

FIG. 5A is a flow chart of an example method that illustrates howindexers process, index, and store data received from forwarders, inaccordance with example embodiments. The data flow illustrated in FIG.5A is provided for illustrative purposes only; those skilled in the artwould understand that one or more of the steps of the processesillustrated in FIG. 5A may be removed or that the ordering of the stepsmay be changed. Furthermore, for the purposes of illustrating a clearexample, one or more particular system components are described in thecontext of performing various operations during each of the data flowstages. For example, a forwarder is described as receiving andprocessing machine data during an input phase; an indexer is describedas parsing and indexing machine data during parsing and indexing phases;and a search head is described as performing a search query during asearch phase. However, other system arrangements and distributions ofthe processing steps across system components may be used.

2.7.1. Input

At block 502, a forwarder receives data from an input source, such as adata source 202 shown in FIG. 2 . A forwarder initially may receive thedata as a raw data stream generated by the input source. For example, aforwarder may receive a data stream from a log file generated by anapplication server, from a stream of network data from a network device,or from any other source of data. In some embodiments, a forwarderreceives the raw data and may segment the data stream into “blocks”,possibly of a uniform data size, to facilitate subsequent processingsteps.

At block 504, a forwarder or other system component annotates each blockgenerated from the raw data with one or more metadata fields. Thesemetadata fields may, for example, provide information related to thedata block as a whole and may apply to each event that is subsequentlyderived from the data in the data block. For example, the metadatafields may include separate fields specifying each of a host, a source,and a source type related to the data block. A host field may contain avalue identifying a host name or IP address of a device that generatedthe data. A source field may contain a value identifying a source of thedata, such as a pathname of a file or a protocol and port related toreceived network data. A source type field may contain a valuespecifying a particular source type label for the data. Additionalmetadata fields may also be included during the input phase, such as acharacter encoding of the data, if known, and possibly other values thatprovide information relevant to later processing steps. In someembodiments, a forwarder forwards the annotated data blocks to anothersystem component (typically an indexer) for further processing.

The data intake and query system allows forwarding of data from one dataintake and query instance to another, or even to a third-party system.The data intake and query system can employ different types offorwarders in a configuration.

In some embodiments, a forwarder may contain the essential componentsneeded to forward data. A forwarder can gather data from a variety ofinputs and forward the data to an indexer for indexing and searching. Aforwarder can also tag metadata (e.g., source, source type, host, etc.).

In some embodiments, a forwarder has the capabilities of theaforementioned forwarder as well as additional capabilities. Theforwarder can parse data before forwarding the data (e.g., can associatea time stamp with a portion of data and create an event, etc.) and canroute data based on criteria such as source or type of event. Theforwarder can also index data locally while forwarding the data toanother indexer.

2.7.2. Parsing

At block 506, an indexer receives data blocks from a forwarder andparses the data to organize the data into events. In some embodiments,to organize the data into events, an indexer may determine a source typeassociated with each data block (e.g., by extracting a source type labelfrom the metadata fields associated with the data block, etc.) and referto a source type configuration corresponding to the identified sourcetype. The source type definition may include one or more properties thatindicate to the indexer to automatically determine the boundaries withinthe received data that indicate the portions of machine data for events.In general, these properties may include regular expression-based rulesor delimiter rules where, for example, event boundaries may be indicatedby predefined characters or character strings. These predefinedcharacters may include punctuation marks or other special charactersincluding, for example, carriage returns, tabs, spaces, line breaks,etc. If a source type for the data is unknown to the indexer, an indexermay infer a source type for the data by examining the structure of thedata. Then, the indexer can apply an inferred source type definition tothe data to create the events.

At block 508, the indexer determines a timestamp for each event. Similarto the process for parsing machine data, an indexer may again refer to asource type definition associated with the data to locate one or moreproperties that indicate instructions for determining a timestamp foreach event. The properties may, for example, instruct an indexer toextract a time value from a portion of data for the event, tointerpolate time values based on timestamps associated with temporallyproximate events, to create a timestamp based on a time the portion ofmachine data was received or generated, to use the timestamp of aprevious event, or use any other rules for determining timestamps.

At block 510, the indexer associates with each event one or moremetadata fields including a field containing the timestamp determinedfor the event. In some embodiments, a timestamp may be included in themetadata fields. These metadata fields may include any number of“default fields” that are associated with all events, and may alsoinclude one more custom fields as defined by a user. Similar to themetadata fields associated with the data blocks at block 504, thedefault metadata fields associated with each event may include a host,source, and source type field including or in addition to a fieldstoring the timestamp.

At block 512, an indexer may optionally apply one or moretransformations to data included in the events created at block 506. Forexample, such transformations can include removing a portion of an event(e.g., a portion used to define event boundaries, extraneous charactersfrom the event, other extraneous text, etc.), masking a portion of anevent (e.g., masking a credit card number), removing redundant portionsof an event, etc. The transformations applied to events may, forexample, be specified in one or more configuration files and referencedby one or more source type definitions.

FIG. 5C illustrates an illustrative example of machine data can bestored in a data store in accordance with various disclosed embodiments.In other embodiments, machine data can be stored in a flat file in acorresponding bucket with an associated index file, such as a timeseries index or “TSIDX.” As such, the depiction of machine data andassociated metadata as rows and columns in the table of FIG. 5C ismerely illustrative and is not intended to limit the data format inwhich the machine data and metadata is stored in various embodimentsdescribed herein. In one particular embodiment, machine data can bestored in a compressed or encrypted formatted. In such embodiments, themachine data can be stored with or be associated with data thatdescribes the compression or encryption scheme with which the machinedata is stored. The information about the compression or encryptionscheme can be used to decompress or decrypt the machine data, and anymetadata with which it is stored, at search time.

As mentioned above, certain metadata, e.g., host 536, source 537, sourcetype 538 and timestamps 535 can be generated for each event, andassociated with a corresponding portion of machine data 539 when storingthe event data in a data store, e.g., data store 208. Any of themetadata can be extracted from the corresponding machine data, orsupplied or defined by an entity, such as a user or computer system. Themetadata fields can become part of or stored with the event. Note thatwhile the time-stamp metadata field can be extracted from the raw dataof each event, the values for the other metadata fields may bedetermined by the indexer based on information it receives pertaining tothe source of the data separate from the machine data.

While certain default or user-defined metadata fields can be extractedfrom the machine data for indexing purposes, all the machine data withinan event can be maintained in its original condition. As such, inembodiments in which the portion of machine data included in an event isunprocessed or otherwise unaltered, it is referred to herein as aportion of raw machine data. In other embodiments, the port of machinedata in an event can be processed or otherwise altered. As such, unlesscertain information needs to be removed for some reasons (e.g.extraneous information, confidential information), all the raw machinedata contained in an event can be preserved and saved in its originalform. Accordingly, the data store in which the event records are storedis sometimes referred to as a “raw record data store.” The raw recorddata store contains a record of the raw event data tagged with thevarious default fields.

In FIG. 5C, the first three rows of the table represent events 531, 532,and 533 and are related to a server access log that records requestsfrom multiple clients processed by a server, as indicated by entry of“access.log” in the source column 536.

In the example shown in FIG. 5C, each of the events 531-534 isassociated with a discrete request made from a client device. The rawmachine data generated by the server and extracted from a server accesslog can include the IP address of the client 540, the user id of theperson requesting the document 541, the time the server finishedprocessing the request 542, the request line from the client 543, thestatus code returned by the server to the client 545, the size of theobject returned to the client (in this case, the gif file requested bythe client) 546 and the time spent to serve the request in microseconds544. As seen in FIG. 5C, all the raw machine data retrieved from theserver access log is retained and stored as part of the correspondingevents, 1221, 1222, and 1223 in the data store.

Event 534 is associated with an entry in a server error log, asindicated by “error.log” in the source column 537, that records errorsthat the server encountered when processing a client request. Similar tothe events related to the server access log, all the raw machine data inthe error log file pertaining to event 534 can be preserved and storedas part of the event 534.

Saving minimally processed or unprocessed machine data in a data storeassociated with metadata fields in the manner similar to that shown inFIG. 5C is advantageous because it allows search of all the machine dataat search time instead of searching only previously specified andidentified fields or field-value pairs. As mentioned above, because datastructures used by various embodiments of the present disclosuremaintain the underlying raw machine data and use a late-binding schemafor searching the raw machines data, it enables a user to continueinvestigating and learn valuable insights about the raw data. In otherwords, the user is not compelled to know about all the fields ofinformation that will be needed at data ingestion time. As a user learnsmore about the data in the events, the user can continue to refine thelate-binding schema by defining new extraction rules, or modifying ordeleting existing extraction rules used by the system.

2.7.3. Indexing

At blocks 514 and 516, an indexer can optionally generate a keywordindex to facilitate fast keyword searching for events. To build akeyword index, at block 514, the indexer identifies a set of keywords ineach event. At block 516, the indexer includes the identified keywordsin an index, which associates each stored keyword with referencepointers to events containing that keyword (or to locations withinevents where that keyword is located, other location identifiers, etc.).When an indexer subsequently receives a keyword-based query, the indexercan access the keyword index to quickly identify events containing thekeyword.

In some embodiments, the keyword index may include entries for fieldname-value pairs found in events, where a field name-value pair caninclude a pair of keywords connected by a symbol, such as an equals signor colon. This way, events containing these field name-value pairs canbe quickly located. In some embodiments, fields can automatically begenerated for some or all of the field names of the field name-valuepairs at the time of indexing. For example, if the string“dest=10.0.1.2” is found in an event, a field named “dest” may becreated for the event, and assigned a value of “10.0.1.2”.

At block 518, the indexer stores the events with an associated timestampin a data store 208. Timestamps enable a user to search for events basedon a time range. In some embodiments, the stored events are organizedinto “buckets,” where each bucket stores events associated with aspecific time range based on the timestamps associated with each event.This improves time-based searching, as well as allows for events withrecent timestamps, which may have a higher likelihood of being accessed,to be stored in a faster memory to facilitate faster retrieval. Forexample, buckets containing the most recent events can be stored inflash memory rather than on a hard disk. In some embodiments, eachbucket may be associated with an identifier, a time range, and a sizeconstraint.

Each indexer 206 may be responsible for storing and searching a subsetof the events contained in a corresponding data store 208. Bydistributing events among the indexers and data stores, the indexers cananalyze events for a query in parallel. For example, using map-reducetechniques, each indexer returns partial responses for a subset ofevents to a search head that combines the results to produce an answerfor the query. By storing events in buckets for specific time ranges, anindexer may further optimize the data retrieval process by searchingbuckets corresponding to time ranges that are relevant to a query.

In some embodiments, each indexer has a home directory and a colddirectory. The home directory of an indexer stores hot buckets and warmbuckets, and the cold directory of an indexer stores cold buckets. A hotbucket is a bucket that is capable of receiving and storing events. Awarm bucket is a bucket that can no longer receive events for storagebut has not yet been moved to the cold directory. A cold bucket is abucket that can no longer receive events and may be a bucket that waspreviously stored in the home directory. The home directory may bestored in faster memory, such as flash memory, as events may be activelywritten to the home directory, and the home directory may typicallystore events that are more frequently searched and thus are accessedmore frequently. The cold directory may be stored in slower and/orlarger memory, such as a hard disk, as events are no longer beingwritten to the cold directory, and the cold directory may typicallystore events that are not as frequently searched and thus are accessedless frequently. In some embodiments, an indexer may also have aquarantine bucket that contains events having potentially inaccurateinformation, such as an incorrect time stamp associated with the eventor a time stamp that appears to be an unreasonable time stamp for thecorresponding event. The quarantine bucket may have events from any timerange; as such, the quarantine bucket may always be searched at searchtime. Additionally, an indexer may store old, archived data in a frozenbucket that is not capable of being searched at search time. In someembodiments, a frozen bucket may be stored in slower and/or largermemory, such as a hard disk, and may be stored in offline and/or remotestorage.

Moreover, events and buckets can also be replicated across differentindexers and data stores to facilitate high availability and disasterrecovery as described in U.S. Pat. No. 9,130,971, entitled “SITE-BASEDSEARCH AFFINITY”, issued on 8 Sep. 2015, and in U.S. Pat. No.14/266,817, entitled “MULTI-SITE CLUSTERING”, issued on 1 Sep. 2015,each of which is hereby incorporated by reference in its entirety forall purposes.

FIG. 5B is a block diagram of an example data store 501 that includes adirectory for each index (or partition) that contains a portion of datamanaged by an indexer. FIG. 5B further illustrates details of anembodiment of an inverted index 507B and an event reference array 515associated with inverted index 507B.

The data store 501 can correspond to a data store 208 that stores eventsmanaged by an indexer 206 or can correspond to a different data storeassociated with an indexer 206. In the illustrated embodiment, the datastore 501 includes a _main directory 503 associated with a _main indexand a _test directory 505 associated with a _test index. However, thedata store 501 can include fewer or more directories. In someembodiments, multiple indexes can share a single directory or allindexes can share a common directory. Additionally, although illustratedas a single data store 501, it will be understood that the data store501 can be implemented as multiple data stores storing differentportions of the information shown in FIG. 5B. For example, a singleindex or partition can span multiple directories or multiple datastores, and can be indexed or searched by multiple correspondingindexers.

In the illustrated embodiment of FIG. 5B, the index-specific directories503 and 505 include inverted indexes 507A, 507B and 509A, 509B,respectively. The inverted indexes 507A...507B, and 509A...509B can bekeyword indexes or field-value pair indexes described herein and caninclude less or more information that depicted in FIG. 5B.

In some embodiments, the inverted index 507A...507B, and 509A...509B cancorrespond to a distinct time-series bucket that is managed by theindexer 206 and that contains events corresponding to the relevant index(e.g., _main index, _test index). As such, each inverted index cancorrespond to a particular range of time for an index. Additional files,such as high performance indexes for each time-series bucket of anindex, can also be stored in the same directory as the inverted indexes507A...507B, and 509A...509B. In some embodiments inverted index507A...507B, and 509A...509B can correspond to multiple time-seriesbuckets or inverted indexes 507A...507B, and 509A...509B can correspondto a single time-series bucket.

Each inverted index 507A...507B, and 509A...509B can include one or moreentries, such as keyword (or token) entries or field-value pair entries.Furthermore, in certain embodiments, the inverted indexes 507A...507B,and 509A...509B can include additional information, such as a time range523 associated with the inverted index or an index identifier 525identifying the index associated with the inverted index 507A...507B,and 509A...509B. However, each inverted index 507A...507B, and509A...509B can include less or more information than depicted.

Token entries, such as token entries 511 illustrated in inverted index507B, can include a token 511A (e.g., “error,” “itemID,” etc.) and eventreferences 511B indicative of events that include the token. Forexample, for the token “error,” the corresponding token entry includesthe token “error” and an event reference, or unique identifier, for eachevent stored in the corresponding time-series bucket that includes thetoken “error.” In the illustrated embodiment of FIG. 5B, the error tokenentry includes the identifiers 3, 5, 6, 8, 11, and 12 corresponding toevents managed by the indexer 206 and associated with the index _main503 that are located in the time-series bucket associated with theinverted index 507B.

In some cases, some token entries can be default entries, automaticallydetermined entries, or user specified entries. In some embodiments, theindexer 206 can identify each word or string in an event as a distincttoken and generate a token entry for it. In some cases, the indexer 206can identify the beginning and ending of tokens based on punctuation,spaces, as described in greater detail herein. In certain cases, theindexer 206 can rely on user input or a configuration file to identifytokens for token entries 511, etc. It will be understood that anycombination of token entries can be included as a default, automaticallydetermined, a or included based on user-specified criteria.

Similarly, field-value pair entries, such as field-value pair entries513 shown in inverted index 507B, can include a field-value pair 513Aand event references 513B indicative of events that include a fieldvalue that corresponds to the field-value pair. For example, for afield-value pair sourcetype::sendmail, a field-value pair entry wouldinclude the field-value pair sourcetype::sendmail and a uniqueidentifier, or event reference, for each event stored in thecorresponding time-series bucket that includes a sendmail sourcetype.

In some cases, the field-value pair entries 513 can be default entries,automatically determined entries, or user specified entries. As anon-limiting example, the field-value pair entries for the fields host,source, sourcetype can be included in the inverted indexes 507A...507B,and 509A...509B as a default. As such, all of the inverted indexes507A...507B, and 509A...509B can include field-value pair entries forthe fields host, source, sourcetype. As yet another non-limitingexample, the field-value pair entries for the IP_address field can beuser specified and may only appear in the inverted index 507B based onuser-specified criteria. As another non-limiting example, as the indexerindexes the events, it can automatically identify field-value pairs andcreate field-value pair entries. For example, based on the indexersreview of events, it can identify IP_address as a field in each eventand add the IP_address field-value pair entries to the inverted index507B. It will be understood that any combination of field-value pairentries can be included as a default, automatically determined, orincluded based on user-specified criteria.

Each unique identifier 517, or event reference, can correspond to aunique event located in the time series bucket. However, the same eventreference can be located in multiple entries. For example if an eventhas a sourcetype splunkd, host www1 and token “warning,” then the uniqueidentifier for the event will appear in the field-value pair entriessourcetype::splunkd and host::www1, as well as the token entry“warning.” With reference to the illustrated embodiment of FIG. 5B andthe event that corresponds to the event reference 3, the event reference3 is found in the field-value pair entries 513 host::hostA,source::sourceB, sourcetype::sourcetypeA, and IP_address::91.205.189.15indicating that the event corresponding to the event references is fromhostA, sourceB, of sourcetypeA, and includes 91.205.189.15 in the eventdata.

For some fields, the unique identifier is located in only onefield-value pair entry for a particular field. For example, the invertedindex may include four sourcetype field-value pair entries correspondingto four different sourcetypes of the events stored in a bucket (e.g.,sourcetypes: sendmail, splunkd, web_access, and web_service). Withinthose four sourcetype field-value pair entries, an identifier for aparticular event may appear in only one of the field-value pair entries.With continued reference to the example illustrated embodiment of FIG.5B, since the event reference 7 appears in the field-value pair entrysourcetype::sourcetypeA, then it does not appear in the otherfield-value pair entries for the sourcetype field, includingsourcetype::sourcetypeB, sourcetype::sourcetypeC, andsourcetype::sourcetypeD.

The event references 517 can be used to locate the events in thecorresponding bucket. For example, the inverted index can include, or beassociated with, an event reference array 515. The event reference array515 can include an array entry 517 for each event reference in theinverted index 507B. Each array entry 517 can include locationinformation 519 of the event corresponding to the unique identifier(non-limiting example: seek address of the event), a timestamp 521associated with the event, or additional information regarding the eventassociated with the event reference, etc.

For each token entry 511 or field-value pair entry 513, the eventreference 501B or unique identifiers can be listed in chronologicalorder or the value of the event reference can be assigned based onchronological data, such as a timestamp associated with the eventreferenced by the event reference. For example, the event reference 1 inthe illustrated embodiment of FIG. 5B can correspond to thefirst-in-time event for the bucket, and the event reference 12 cancorrespond to the last-in-time event for the bucket. However, the eventreferences can be listed in any order, such as reverse chronologicalorder, ascending order, descending order, or some other order, etc.Further, the entries can be sorted. For example, the entries can besorted alphabetically (collectively or within a particular group), byentry origin (e.g., default, automatically generated, user-specified,etc.), by entry type (e.g., field-value pair entry, token entry, etc.),or chronologically by when added to the inverted index, etc. In theillustrated embodiment of FIG. 5B, the entries are sorted first by entrytype and then alphabetically.

As a non-limiting example of how the inverted indexes 507A...507B, and509A...509B can be used during a data categorization request command,the indexers can receive filter criteria indicating data that is to becategorized and categorization criteria indicating how the data is to becategorized. Example filter criteria can include, but is not limited to,indexes (or partitions), hosts, sources, sourcetypes, time ranges, fieldidentifier, keywords, etc.

Using the filter criteria, the indexer identifies relevant invertedindexes to be searched. For example, if the filter criteria includes aset of partitions, the indexer can identify the inverted indexes storedin the directory corresponding to the particular partition as relevantinverted indexes. Other means can be used to identify inverted indexesassociated with a partition of interest. For example, in someembodiments, the indexer can review an entry in the inverted indexes,such as an index-value pair entry 513 to determine if a particularinverted index is relevant. If the filter criteria does not identify anypartition, then the indexer can identify all inverted indexes managed bythe indexer as relevant inverted indexes.

Similarly, if the filter criteria includes a time range, the indexer canidentify inverted indexes corresponding to buckets that satisfy at leasta portion of the time range as relevant inverted indexes. For example,if the time range is last hour then the indexer can identify allinverted indexes that correspond to buckets storing events associatedwith timestamps within the last hour as relevant inverted indexes.

When used in combination, an index filter criterion specifying one ormore partitions and a time range filter criterion specifying aparticular time range can be used to identify a subset of invertedindexes within a particular directory (or otherwise associated with aparticular partition) as relevant inverted indexes. As such, the indexercan focus the processing to only a subset of the total number ofinverted indexes that the indexer manages.

Once the relevant inverted indexes are identified, the indexer canreview them using any additional filter criteria to identify events thatsatisfy the filter criteria. In some cases, using the known location ofthe directory in which the relevant inverted indexes are located, theindexer can determine that any events identified using the relevantinverted indexes satisfy an index filter criterion. For example, if thefilter criteria includes a partition main, then the indexer candetermine that any events identified using inverted indexes within thepartition main directory (or otherwise associated with the partitionmain) satisfy the index filter criterion.

Furthermore, based on the time range associated with each invertedindex, the indexer can determine that that any events identified using aparticular inverted index satisfies a time range filter criterion. Forexample, if a time range filter criterion is for the last hour and aparticular inverted index corresponds to events within a time range of50 minutes ago to 35 minutes ago, the indexer can determine that anyevents identified using the particular inverted index satisfy the timerange filter criterion. Conversely, if the particular inverted indexcorresponds to events within a time range of 59 minutes ago to 62minutes ago, the indexer can determine that some events identified usingthe particular inverted index may not satisfy the time range filtercriterion.

Using the inverted indexes, the indexer can identify event references(and therefore events) that satisfy the filter criteria. For example, ifthe token “error” is a filter criterion, the indexer can track all eventreferences within the token entry “error.” Similarly, the indexer canidentify other event references located in other token entries orfield-value pair entries that match the filter criteria. The system canidentify event references located in all of the entries identified bythe filter criteria. For example, if the filter criteria include thetoken “error” and field-value pair sourcetype::web_ui, the indexer cantrack the event references found in both the token entry “error” and thefield-value pair entry sourcetype::web_ui. As mentioned previously, insome cases, such as when multiple values are identified for a particularfilter criterion (e.g., multiple sources for a source filter criterion),the system can identify event references located in at least one of theentries corresponding to the multiple values and in all other entriesidentified by the filter criteria. The indexer can determine that theevents associated with the identified event references satisfy thefilter criteria.

In some cases, the indexer can further consult a timestamp associatedwith the event reference to determine whether an event satisfies thefilter criteria. For example, if an inverted index corresponds to a timerange that is partially outside of a time range filter criterion, thenthe indexer can consult a timestamp associated with the event referenceto determine whether the corresponding event satisfies the time rangecriterion. In some embodiments, to identify events that satisfy a timerange, the indexer can review an array, such as the event referencearray 1614 that identifies the time associated with the events.Furthermore, as mentioned above using the known location of thedirectory in which the relevant inverted indexes are located (or otherindex identifier), the indexer can determine that any events identifiedusing the relevant inverted indexes satisfy the index filter criterion.

In some cases, based on the filter criteria, the indexer reviews anextraction rule. In certain embodiments, if the filter criteria includesa field name that does not correspond to a field-value pair entry in aninverted index, the indexer can review an extraction rule, which may belocated in a configuration file, to identify a field that corresponds toa field-value pair entry in the inverted index.

For example, the filter criteria includes a field name “sessionID” andthe indexer determines that at least one relevant inverted index doesnot include a field-value pair entry corresponding to the field namesessionID, the indexer can review an extraction rule that identifies howthe sessionID field is to be extracted from a particular host, source,or sourcetype (implicitly identifying the particular host, source, orsourcetype that includes a sessionID field). The indexer can replace thefield name “sessionID” in the filter criteria with the identified host,source, or sourcetype. In some cases, the field name “sessionID” may beassociated with multiples hosts, sources, or sourcetypes, in which case,all identified hosts, sources, and sourcetypes can be added as filtercriteria. In some cases, the identified host, source, or sourcetype canreplace or be appended to a filter criterion, or be excluded. Forexample, if the filter criteria includes a criterion for source S1 andthe “sessionID” field is found in source S2, the source S2 can replaceS1 in the filter criteria, be appended such that the filter criteriaincludes source S1 and source S2, or be excluded based on the presenceof the filter criterion source S1. If the identified host, source, orsourcetype is included in the filter criteria, the indexer can thenidentify a field-value pair entry in the inverted index that includes afield value corresponding to the identity of the particular host,source, or sourcetype identified using the extraction rule.

Once the events that satisfy the filter criteria are identified, thesystem, such as the indexer 206 can categorize the results based on thecategorization criteria. The categorization criteria can includecategories for grouping the results, such as any combination ofpartition, source, sourcetype, or host, or other categories or fields asdesired.

The indexer can use the categorization criteria to identifycategorization criteria-value pairs or categorization criteria values bywhich to categorize or group the results. The categorizationcriteria-value pairs can correspond to one or more field-value pairentries stored in a relevant inverted index, one or more index-valuepairs based on a directory in which the inverted index is located or anentry in the inverted index (or other means by which an inverted indexcan be associated with a partition), or other criteria-value pair thatidentifies a general category and a particular value for that category.The categorization criteria values can correspond to the value portionof the categorization criteria-value pair.

As mentioned, in some cases, the categorization criteria-value pairs cancorrespond to one or more field-value pair entries stored in therelevant inverted indexes. For example, the categorizationcriteria-value pairs can correspond to field-value pair entries of host,source, and sourcetype (or other field-value pair entry as desired). Forinstance, if there are ten different hosts, four different sources, andfive different sourcetypes for an inverted index, then the invertedindex can include ten host field-value pair entries, four sourcefield-value pair entries, and five sourcetype field-value pair entries.The indexer can use the nineteen distinct field-value pair entries ascategorization criteria-value pairs to group the results.

Specifically, the indexer can identify the location of the eventreferences associated with the events that satisfy the filter criteriawithin the field-value pairs, and group the event references based ontheir location. As such, the indexer can identify the particular fieldvalue associated with the event corresponding to the event reference.For example, if the categorization criteria include host and sourcetype,the host field-value pair entries and sourcetype field-value pairentries can be used as categorization criteria-value pairs to identifythe specific host and sourcetype associated with the events that satisfythe filter criteria.

In addition, as mentioned, categorization criteria-value pairs cancorrespond to data other than the field-value pair entries in therelevant inverted indexes. For example, if partition or index is used asa categorization criterion, the inverted indexes may not includepartition field-value pair entries. Rather, the indexer can identify thecategorization criteria-value pair associated with the partition basedon the directory in which an inverted index is located, information inthe inverted index, or other information that associates the invertedindex with the partition, etc. As such a variety of methods can be usedto identify the categorization criteria-value pairs from thecategorization criteria.

Accordingly based on the categorization criteria (and categorizationcriteria-value pairs), the indexer can generate groupings based on theevents that satisfy the filter criteria. As a non-limiting example, ifthe categorization criteria includes a partition and sourcetype, thenthe groupings can correspond to events that are associated with eachunique combination of partition and sourcetype. For instance, if thereare three different partitions and two different sourcetypes associatedwith the identified events, then the six different groups can be formed,each with a unique partition value-sourcetype value combination.Similarly, if the categorization criteria includes partition,sourcetype, and host and there are two different partitions, threesourcetypes, and five hosts associated with the identified events, thenthe indexer can generate up to thirty groups for the results thatsatisfy the filter criteria. Each group can be associated with a uniquecombination of categorization criteria-value pairs (e.g., uniquecombinations of partition value sourcetype value, and host value).

In addition, the indexer can count the number of events associated witheach group based on the number of events that meet the uniquecombination of categorization criteria for a particular group (or matchthe categorization criteria-value pairs for the particular group). Withcontinued reference to the example above, the indexer can count thenumber of events that meet the unique combination of partition,sourcetype, and host for a particular group.

Each indexer communicates the groupings to the search head. The searchhead can aggregate the groupings from the indexers and provide thegroupings for display. In some cases, the groups are displayed based onat least one of the host, source, sourcetype, or partition associatedwith the groupings. In some embodiments, the search head can furtherdisplay the groups based on display criteria, such as a display order ora sort order as described in greater detail above.

As a non-limiting example and with reference to FIG. 5B, consider arequest received by an indexer 206 that includes the following filtercriteria: keyword=error, partition=_main, time range = Mar. 01, 201716:22.00.000-16:28.00.000, sourcetype=sourcetypeC, host=hostB, and thefollowing categorization criteria: source.

Based on the above criteria, the indexer 206 identifies _main directory503 and can ignore _test directory 505 and any other partition-specificdirectories. The indexer determines that inverted partition 507B is arelevant partition based on its location within the _main directory 503and the time range associated with it. For sake of simplicity in thisexample, the indexer 206 determines that no other inverted indexes inthe _main directory 503, such as inverted index 507A satisfy the timerange criterion.

Having identified the relevant inverted index 507B, the indexer reviewsthe token entries 511 and the field-value pair entries 513 to identifyevent references, or events, that satisfy all of the filter criteria.

With respect to the token entries 511, the indexer can review the errortoken entry and identify event references 3, 5, 6, 8, 11, 12, indicatingthat the term “error” is found in the corresponding events. Similarly,the indexer can identify event references 4, 5, 6, 8, 9, 10, 11 in thefield-value pair entry sourcetype::sourcetypeC and event references 2,5, 6, 8, 10, 11 in the field-value pair entry host::hostB. As the filtercriteria did not include a source or an IP_address field-value pair, theindexer can ignore those field-value pair entries.

In addition to identifying event references found in at least one tokenentry or field-value pair entry (e.g., event references 3, 4, 5, 6, 8,9, 10, 11, 12), the indexer can identify events (and corresponding eventreferences) that satisfy the time range criterion using the eventreference array 1614 (e.g., event references 2, 3, 4, 5, 6, 7, 8, 9,10). Using the information obtained from the inverted index 507B(including the event reference array 515), the indexer 206 can identifythe event references that satisfy all of the filter criteria (e.g.,event references 5, 6, 8).

Having identified the events (and event references) that satisfy all ofthe filter criteria, the indexer 206 can group the event referencesusing the received categorization criteria (source). In doing so, theindexer can determine that event references 5 and 6 are located in thefield-value pair entry source::sourceD (or have matching categorizationcriteria-value pairs) and event reference 8 is located in thefield-value pair entry source::sourceC. Accordingly, the indexer cangenerate a sourceC group having a count of one corresponding toreference 8 and a sourceD group having a count of two corresponding toreferences 5 and 6. This information can be communicated to the searchhead. In turn the search head can aggregate the results from the variousindexers and display the groupings. As mentioned above, in someembodiments, the groupings can be displayed based at least in part onthe categorization criteria, including at least one of host, source,sourcetype, or partition.

It will be understood that a change to any of the filter criteria orcategorization criteria can result in different groupings. As a onenon-limiting example, a request received by an indexer 206 that includesthe following filter criteria: partition=_main, time range = Mar. 01,2017 Mar. 01, 2017 16:21:20.000 - 16:28:17.000, and the followingcategorization criteria: host, source, sourcetype would result in theindexer identifying event references 1-12 as satisfying the filtercriteria. The indexer would then generate up to 24 groupingscorresponding to the 24 different combinations of the categorizationcriteria-value pairs, including host (hostA, hostB), source (sourceA,sourceB, sourceC, sourceD), and sourcetype (sourcetypeA, sourcetypeB,sourcetypeC). However, as there are only twelve events identifiers inthe illustrated embodiment and some fall into the same grouping, theindexer generates eight groups and counts as follows:

-   Group 1 (hostA, sourceA, sourcetypeA): 1 (event reference 7)-   Group 2 (hostA, sourceA, sourcetypeB): 2 (event references 1, 12)-   Group 3 (hostA, sourceA, sourcetypeC): 1 (event reference 4)-   Group 4 (hostA, sourceB, sourcetypeA): 1 (event reference 3)-   Group 5 (hostA, sourceB, sourcetypeC): 1 (event reference 9)-   Group 6 (hostB, sourceC, sourcetypeA): 1 (event reference 2)-   Group 7 (hostB, sourceC, sourcetypeC): 2 (event references 8, 11)-   Group 8 (hostB, sourceD, sourcetypeC): 3 (event references 5, 6, 10)

As noted, each group has a unique combination of categorizationcriteria-value pairs or categorization criteria values. The indexercommunicates the groups to the search head for aggregation with resultsreceived from other indexers. In communicating the groups to the searchhead, the indexer can include the categorization criteria-value pairsfor each group and the count. In some embodiments, the indexer caninclude more or less information. For example, the indexer can includethe event references associated with each group and other identifyinginformation, such as the indexer or inverted index used to identify thegroups.

As another non-limiting examples, a request received by an indexer 206that includes the following filter criteria: partition=_main, time range= Mar. 01, 2017Mar. 01, 2017 16:21:20.000-16:28:17.000, source=sourceA,sourceD, and keyword=itemID and the following categorization criteria:host, source, sourcetype would result in the indexer identifying eventreferences 4, 7, and 10 as satisfying the filter criteria, and generatethe following groups:

-   Group 1 (hostA, sourceA, sourcetypeC): 1 (event reference 4)-   Group 2 (hostA, sourceA, sourcetypeA): 1 (event reference 7)-   Group 3 (hostB, sourceD, sourcetypeC): 1 (event references 10)

The indexer communicates the groups to the search head for aggregationwith results received from other indexers. As will be understand thereare myriad ways for filtering and categorizing the events and eventreferences. For example, the indexer can review multiple invertedindexes associated with an partition or review the inverted indexes ofmultiple partitions, and categorize the data using any one or anycombination of partition, host, source, sourcetype, or other category,as desired.

Further, if a user interacts with a particular group, the indexer canprovide additional information regarding the group. For example, theindexer can perform a targeted search or sampling of the events thatsatisfy the filter criteria and the categorization criteria for theselected group, also referred to as the filter criteria corresponding tothe group or filter criteria associated with the group.

In some cases, to provide the additional information, the indexer relieson the inverted index. For example, the indexer can identify the eventreferences associated with the events that satisfy the filter criteriaand the categorization criteria for the selected group and then use theevent reference array 515 to access some or all of the identifiedevents. In some cases, the categorization criteria values orcategorization criteria-value pairs associated with the group becomepart of the filter criteria for the review.

With reference to FIG. 5B for instance, suppose a group is displayedwith a count of six corresponding to event references 4, 5, 6, 8, 10, 11(i.e., event references 4, 5, 6, 8, 10, 11 satisfy the filter criteriaand are associated with matching categorization criteria values orcategorization criteria-value pairs) and a user interacts with the group(e.g., selecting the group, clicking on the group, etc.). In response,the search head communicates with the indexer to provide additionalinformation regarding the group.

In some embodiments, the indexer identifies the event referencesassociated with the group using the filter criteria and thecategorization criteria for the group (e.g., categorization criteriavalues or categorization criteria-value pairs unique to the group).Together, the filter criteria and the categorization criteria for thegroup can be referred to as the filter criteria associated with thegroup. Using the filter criteria associated with the group, the indexeridentifies event references 4, 5, 6, 8, 10, 11.

Based on a sampling criteria, discussed in greater detail above, theindexer can determine that it will analyze a sample of the eventsassociated with the event references 4, 5, 6, 8, 10, 11. For example,the sample can include analyzing event data associated with the eventreferences 5, 8, 10. In some embodiments, the indexer can use the eventreference array 1616 to access the event data associated with the eventreferences 5, 8, 10. Once accessed, the indexer can compile the relevantinformation and provide it to the search head for aggregation withresults from other indexers. By identifying events and sampling eventdata using the inverted indexes, the indexer can reduce the amount ofactual data this is analyzed and the number of events that are accessedin order to generate the summary of the group and provide a response inless time.

2.8. Query Processing

FIG. 6A is a flow diagram of an example method that illustrates how asearch head and indexers perform a search query, in accordance withexample embodiments. At block 602, a search head receives a search queryfrom a client. At block 604, the search head analyzes the search queryto determine what portion(s) of the query can be delegated to indexersand what portions of the query can be executed locally by the searchhead. At block 606, the search head distributes the determined portionsof the query to the appropriate indexers. In some embodiments, a searchhead cluster may take the place of an independent search head where eachsearch head in the search head cluster coordinates with peer searchheads in the search head cluster to schedule jobs, replicate searchresults, update configurations, fulfill search requests, etc. In someembodiments, the search head (or each search head) communicates with amaster node (also known as a cluster master, not shown in FIG. 2 ) thatprovides the search head with a list of indexers to which the searchhead can distribute the determined portions of the query. The masternode maintains a list of active indexers and can also designate whichindexers may have responsibility for responding to queries over certainsets of events. A search head may communicate with the master nodebefore the search head distributes queries to indexers to discover theaddresses of active indexers.

At block 608, the indexers to which the query was distributed, searchdata stores associated with them for events that are responsive to thequery. To determine which events are responsive to the query, theindexer searches for events that match the criteria specified in thequery. These criteria can include matching keywords or specific valuesfor certain fields. The searching operations at block 608 may use thelate-binding schema to extract values for specified fields from eventsat the time the query is processed. In some embodiments, one or morerules for extracting field values may be specified as part of a sourcetype definition in a configuration file. The indexers may then eithersend the relevant events back to the search head, or use the events todetermine a partial result, and send the partial result back to thesearch head.

At block 610, the search head combines the partial results and/or eventsreceived from the indexers to produce a final result for the query. Insome examples, the results of the query are indicative of performance orsecurity of the IT environment and may help improve the performance ofcomponents in the IT environment. This final result may comprisedifferent types of data depending on what the query requested. Forexample, the results can include a listing of matching events returnedby the query, or some type of visualization of the data from thereturned events. In another example, the final result can include one ormore calculated values derived from the matching events.

The results generated by the system 108 can be returned to a clientusing different techniques. For example, one technique streams resultsor relevant events back to a client in real-time as they are identified.Another technique waits to report the results to the client until acomplete set of results (which may include a set of relevant events or aresult based on relevant events) is ready to return to the client. Yetanother technique streams interim results or relevant events back to theclient in real-time until a complete set of results is ready, and thenreturns the complete set of results to the client. In another technique,certain results are stored as “search jobs” and the client may retrievethe results by referring the search jobs.

The search head can also perform various operations to make the searchmore efficient. For example, before the search head begins execution ofa query, the search head can determine a time range for the query and aset of common keywords that all matching events include. The search headmay then use these parameters to query the indexers to obtain a supersetof the eventual results. Then, during a filtering stage, the search headcan perform field-extraction operations on the superset to produce areduced set of search results. This speeds up queries, which may beparticularly helpful for queries that are performed on a periodic basis.

2.9. Pipelined Search Language

Various embodiments of the present disclosure can be implemented using,or in conjunction with, a pipelined command language. A pipelinedcommand language is a language in which a set of inputs or data isoperated on by a first command in a sequence of commands, and thensubsequent commands in the order they are arranged in the sequence. Suchcommands can include any type of functionality for operating on data,such as retrieving, searching, filtering, aggregating, processing,transmitting, and the like. As described herein, a query can thus beformulated in a pipelined command language and include any number ofordered or unordered commands for operating on data.

Splunk Processing Language (SPL) is an example of a pipelined commandlanguage in which a set of inputs or data is operated on by any numberof commands in a particular sequence. A sequence of commands, or commandsequence, can be formulated such that the order in which the commandsare arranged defines the order in which the commands are applied to aset of data or the results of an earlier executed command. For example,a first command in a command sequence can operate to search or filterfor specific data in particular set of data. The results of the firstcommand can then be passed to another command listed later in thecommand sequence for further processing.

In various embodiments, a query can be formulated as a command sequencedefined in a command line of a search UI. In some embodiments, a querycan be formulated as a sequence of SPL commands. Some or all of the SPLcommands in the sequence of SPL commands can be separated from oneanother by a pipe symbol “|”. In such embodiments, a set of data, suchas a set of events, can be operated on by a first SPL command in thesequence, and then a subsequent SPL command following a pipe symbol “|”after the first SPL command operates on the results produced by thefirst SPL command or other set of data, and so on for any additional SPLcommands in the sequence. As such, a query formulated using SPLcomprises a series of consecutive commands that are delimited by pipe“|” characters. The pipe character indicates to the system that theoutput or result of one command (to the left of the pipe) should be usedas the input for one of the subsequent commands (to the right of thepipe). This enables formulation of queries defined by a pipeline ofsequenced commands that refines or enhances the data at each step alongthe pipeline until the desired results are attained. Accordingly,various embodiments described herein can be implemented with SplunkProcessing Language (SPL) used in conjunction with the SPLUNK®ENTERPRISE system.

While a query can be formulated in many ways, a query can start with asearch command and one or more corresponding search terms at thebeginning of the pipeline. Such search terms can include any combinationof keywords, phrases, times, dates, Boolean expressions, fieldname-fieldvalue pairs, etc. that specify which results should be obtained from anindex. The results can then be passed as inputs into subsequent commandsin a sequence of commands by using, for example, a pipe character. Thesubsequent commands in a sequence can include directives for additionalprocessing of the results once it has been obtained from one or moreindexes. For example, commands may be used to filter unwantedinformation out of the results, extract more information, evaluate fieldvalues, calculate statistics, reorder the results, create an alert,create summary of the results, or perform some type of aggregationfunction. In some embodiments, the summary can include a graph, chart,metric, or other visualization of the data. An aggregation function caninclude analysis or calculations to return an aggregate value, such asan average value, a sum, a maximum value, a root mean square,statistical values, and the like.

Due to its flexible nature, use of a pipelined command language invarious embodiments is advantageous because it can perform “filtering”as well as “processing” functions. In other words, a single query caninclude a search command and search term expressions, as well asdata-analysis expressions. For example, a command at the beginning of aquery can perform a “filtering” step by retrieving a set of data basedon a condition (e.g., records associated with server response times ofless than 1 microsecond). The results of the filtering step can then bepassed to a subsequent command in the pipeline that performs a“processing” step (e.g. calculation of an aggregate value related to thefiltered events such as the average response time of servers withresponse times of less than 1 microsecond). Furthermore, the searchcommand can allow events to be filtered by keyword as well as fieldvalue criteria. For example, a search command can filter out all eventscontaining the word “warning” or filter out all events where a fieldvalue associated with a field “clientip” is “10.0.1.2.”

The results obtained or generated in response to a command in a querycan be considered a set of results data. The set of results data can bepassed from one command to another in any data format. In oneembodiment, the set of result data can be in the form of a dynamicallycreated table. Each command in a particular query can redefine the shapeof the table. In some implementations, an event retrieved from an indexin response to a query can be considered a row with a column for eachfield value. Columns contain basic information about the data and alsomay contain data that has been dynamically extracted at search time.

FIG. 6B provides a visual representation of the manner in which apipelined command language or query operates in accordance with thedisclosed embodiments. The query 630 can be inputted by the user into asearch. The query comprises a search, the results of which are piped totwo commands (namely, command 1 and command 2) that follow the searchstep.

Disk 622 represents the event data in the raw record data store.

When a user query is processed, a search step will precede other queriesin the pipeline in order to generate a set of events at block 640. Forexample, the query can comprise search terms “sourcetype = syslog ERROR”at the front of the pipeline as shown in FIG. 6B. Intermediate resultstable 624 shows fewer rows because it represents the subset of eventsretrieved from the index that matched the search terms “sourcetype =syslog ERROR” from search command 630. By way of further example,instead of a search step, the set of events at the head of the pipelinemay be generating by a call to a pre-existing inverted index (as will beexplained later).

At block 642, the set of events generated in the first part of the querymay be piped to a query that searches the set of events for field-valuepairs or for keywords. For example, the second intermediate resultstable 626 shows fewer columns, representing the result of the topcommand, “top user” which summarizes the events into a list of the top10 users and displays the user, count, and percentage.

Finally, at block 644, the results of the prior stage can be pipelinedto another stage where further filtering or processing of the data canbe performed, e.g., preparing the data for display purposes, filteringthe data based on a condition, performing a mathematical calculationwith the data, etc. As shown in FIG. 6B, the “fields - percent” part ofcommand 630 removes the column that shows the percentage, thereby,leaving a final results table 628 without a percentage column. Indifferent embodiments, other query languages, such as the StructuredQuery Language (“SQL”), can be used to create a query.

2.10. Field Extraction

The search head 210 allows users to search and visualize eventsgenerated from machine data received from homogenous data sources. Thesearch head 210 also allows users to search and visualize eventsgenerated from machine data received from heterogeneous data sources.The search head 210 includes various mechanisms, which may additionallyreside in an indexer 206, for processing a query. A query language maybe used to create a query, such as any suitable pipelined querylanguage. For example, Splunk Processing Language (SPL) can be utilizedto make a query. SPL is a pipelined search language in which a set ofinputs is operated on by a first command in a command line, and then asubsequent command following the pipe symbol “|” operates on the resultsproduced by the first command, and so on for additional commands. Otherquery languages, such as the Structured Query Language (“SQL”), can beused to create a query.

In response to receiving the search query, search head 210 usesextraction rules to extract values for fields in the events beingsearched. The search head 210 obtains extraction rules that specify howto extract a value for fields from an event. Extraction rules cancomprise regex rules that specify how to extract values for the fieldscorresponding to the extraction rules. In addition to specifying how toextract field values, the extraction rules may also include instructionsfor deriving a field value by performing a function on a characterstring or value retrieved by the extraction rule. For example, anextraction rule may truncate a character string or convert the characterstring into a different data format. In some cases, the query itself canspecify one or more extraction rules.

The search head 210 can apply the extraction rules to events that itreceives from indexers 206. Indexers 206 may apply the extraction rulesto events in an associated data store 208. Extraction rules can beapplied to all the events in a data store or to a subset of the eventsthat have been filtered based on some criteria (e.g., event time stampvalues, etc.). Extraction rules can be used to extract one or morevalues for a field from events by parsing the portions of machine datain the events and examining the data for one or more patterns ofcharacters, numbers, delimiters, etc., that indicate where the fieldbegins and, optionally, ends.

FIG. 7A is a diagram of an example scenario where a common customeridentifier is found among log data received from three disparate datasources, in accordance with example embodiments. In this example, a usersubmits an order for merchandise using a vendor’s shopping applicationprogram 701 running on the user’s system. In this example, the order wasnot delivered to the vendor’s server due to a resource exception at thedestination server that is detected by the middleware code 702. The userthen sends a message to the customer support server 703 to complainabout the order failing to complete. The three systems 701, 702, and 703are disparate systems that do not have a common logging format. Theorder application 701 sends log data 704 to the data intake and querysystem in one format, the middleware code 702 sends error log data 705in a second format, and the support server 703 sends log data 706 in athird format.

Using the log data received at one or more indexers 206 from the threesystems, the vendor can uniquely obtain an insight into user activity,user experience, and system behavior. The search head 210 allows thevendor’s administrator to search the log data from the three systemsthat one or more indexers 206 are responsible for searching, therebyobtaining correlated information, such as the order number andcorresponding customer ID number of the person placing the order. Thesystem also allows the administrator to see a visualization of relatedevents via a user interface. The administrator can query the search head210 for customer ID field value matches across the log data from thethree systems that are stored at the one or more indexers 206. Thecustomer ID field value exists in the data gathered from the threesystems, but the customer ID field value may be located in differentareas of the data given differences in the architecture of the systems.There is a semantic relationship between the customer ID field valuesgenerated by the three systems. The search head 210 requests events fromthe one or more indexers 206 to gather relevant events from the threesystems. The search head 210 then applies extraction rules to the eventsin order to extract field values that it can correlate. The search headmay apply a different extraction rule to each set of events from eachsystem when the event format differs among systems. In this example, theuser interface can display to the administrator the events correspondingto the common customer ID field values 707, 708, and 709, therebyproviding the administrator with insight into a customer’s experience.

Note that query results can be returned to a client, a search head, orany other system component for further processing. In general, queryresults may include a set of one or more events, a set of one or morevalues obtained from the events, a subset of the values, statisticscalculated based on the values, a report containing the values, avisualization (e.g., a graph or chart) generated from the values, andthe like.

The search system enables users to run queries against the stored datato retrieve events that meet criteria specified in a query, such ascontaining certain keywords or having specific values in defined fields.FIG. 7B illustrates the manner in which keyword searches and fieldsearches are processed in accordance with disclosed embodiments.

If a user inputs a search query into search bar 1401 that includes onlykeywords (also known as “tokens”), e.g., the keyword “error” or“warning”, the query search engine of the data intake and query systemsearches for those keywords directly in the event data 722 stored in theraw record data store. Note that while FIG. 7B only illustrates fourevents, the raw record data store (corresponding to data store 208 inFIG. 2 ) may contain records for millions of events.

As disclosed above, an indexer can optionally generate a keyword indexto facilitate fast keyword searching for event data. The indexerincludes the identified keywords in an index, which associates eachstored keyword with reference pointers to events containing that keyword(or to locations within events where that keyword is located, otherlocation identifiers, etc.). When an indexer subsequently receives akeyword-based query, the indexer can access the keyword index to quicklyidentify events containing the keyword. For example, if the keyword“HTTP” was indexed by the indexer at index time, and the user searchesfor the keyword “HTTP”, events 713 to 715 will be identified based onthe results returned from the keyword index. As noted above, the indexcontains reference pointers to the events containing the keyword, whichallows for efficient retrieval of the relevant events from the rawrecord data store.

If a user searches for a keyword that has not been indexed by theindexer, the data intake and query system would nevertheless be able toretrieve the events by searching the event data for the keyword in theraw record data store directly as shown in FIG. 7B. For example, if auser searches for the keyword “frank”, and the name “frank” has not beenindexed at index time, the DATA INTAKE AND QUERY system will search theevent data directly and return the first event 713. Note that whetherthe keyword has been indexed at index time or not, in both cases the rawdata with the events 712 is accessed from the raw data record store toservice the keyword search. In the case where the keyword has beenindexed, the index will contain a reference pointer that will allow fora more efficient retrieval of the event data from the data store. If thekeyword has not been indexed, the search engine will need to searchthrough all the records in the data store to service the search.

In most cases, however, in addition to keywords, a user’s search willalso include fields. The term “field” refers to a location in the eventdata containing one or more values for a specific data item. Often, afield is a value with a fixed, delimited position on a line, or a nameand value pair, where there is a single value to each field name. Afield can also be multivalued, that is, it can appear more than once inan event and have a different value for each appearance, e.g., emailaddress fields. Fields are searchable by the field name or fieldname-value pairs. Some examples of fields are “clientip” for IPaddresses accessing a web server, or the “From” and “To” fields in emailaddresses.

By way of further example, consider the search, “status=404”. Thissearch query finds events with “status” fields that have a value of“404.” When the search is run, the search engine does not look forevents with any other “status” value. It also does not look for eventscontaining other fields that share “404” as a value. As a result, thesearch returns a set of results that are more focused than if “404” hadbeen used in the search string as part of a keyword search. Note alsothat fields can appear in events as “key=value” pairs such as“user_name=Bob.” But in most cases, field values appear in fixed,delimited positions without identifying keys. For example, the datastore may contain events where the “user_name” value always appears byitself after the timestamp as illustrated by the following string: “Nov15 09:33:22 johnmedlock.”

The data intake and query system advantageously allows for search timefield extraction. In other words, fields can be extracted from the eventdata at search time using late-binding schema as opposed to at dataingestion time, which was a major limitation of the prior art systems.

In response to receiving the search query, search head 210 usesextraction rules to extract values for the fields associated with afield or fields in the event data being searched. The search head 210obtains extraction rules that specify how to extract a value for certainfields from an event. Extraction rules can comprise regex rules thatspecify how to extract values for the relevant fields. In addition tospecifying how to extract field values, the extraction rules may alsoinclude instructions for deriving a field value by performing a functionon a character string or value retrieved by the extraction rule. Forexample, a transformation rule may truncate a character string, orconvert the character string into a different data format. In somecases, the query itself can specify one or more extraction rules.

FIG. 7B illustrates the manner in which configuration files may be usedto configure custom fields at search time in accordance with thedisclosed embodiments. In response to receiving a search query, the dataintake and query system determines if the query references a “field.”For example, a query may request a list of events where the “clientip”field equals “127.0.0.1.” If the query itself does not specify anextraction rule and if the field is not a metadata field, e.g., time,host, source, source type, etc., then in order to determine anextraction rule, the search engine may, in one or more embodiments, needto locate configuration file 712 during the execution of the search asshown in FIG. 7B.

Configuration file 712 may contain extraction rules for all the variousfields that are not metadata fields, e.g., the “clientip” field. Theextraction rules may be inserted into the configuration file in avariety of ways. In some embodiments, the extraction rules can compriseregular expression rules that are manually entered in by the user.Regular expressions match patterns of characters in text and are usedfor extracting custom fields in text.

In one or more embodiments, as noted above, a field extractor may beconfigured to automatically generate extraction rules for certain fieldvalues in the events when the events are being created, indexed, orstored, or possibly at a later time. In one embodiment, a user may beable to dynamically create custom fields by highlighting portions of asample event that should be extracted as fields using a graphical userinterface. The system would then generate a regular expression thatextracts those fields from similar events and store the regularexpression as an extraction rule for the associated field in theconfiguration file 712.

In some embodiments, the indexers may automatically discover certaincustom fields at index time and the regular expressions for those fieldswill be automatically generated at index time and stored as part ofextraction rules in configuration file 712. For example, fields thatappear in the event data as “key=value” pairs may be automaticallyextracted as part of an automatic field discovery process. Note thatthere may be several other ways of adding field definitions toconfiguration files in addition to the methods discussed herein.

The search head 210 can apply the extraction rules derived fromconfiguration file 1402 to event data that it receives from indexers206. Indexers 206 may apply the extraction rules from the configurationfile to events in an associated data store 208. Extraction rules can beapplied to all the events in a data store, or to a subset of the eventsthat have been filtered based on some criteria (e.g., event time stampvalues, etc.). Extraction rules can be used to extract one or morevalues for a field from events by parsing the event data and examiningthe event data for one or more patterns of characters, numbers,delimiters, etc., that indicate where the field begins and, optionally,ends.

In one more embodiments, the extraction rule in configuration file 712will also need to define the type or set of events that the rule appliesto. Because the raw record data store will contain events from multipleheterogeneous sources, multiple events may contain the same fields indifferent locations because of discrepancies in the format of the datagenerated by the various sources. Furthermore, certain events may notcontain a particular field at all. For example, event 719 also contains“clientip” field, however, the “clientip” field is in a different formatfrom events 713-715. To address the discrepancies in the format andcontent of the different types of events, the configuration file willalso need to specify the set of events that an extraction rule appliesto, e.g., extraction rule 716 specifies a rule for filtering by the typeof event and contains a regular expression for parsing out the fieldvalue. Accordingly, each extraction rule will pertain to only aparticular type of event. If a particular field, e.g., “clientip” occursin multiple events, each of those types of events would need its owncorresponding extraction rule in the configuration file 712 and each ofthe extraction rules would comprise a different regular expression toparse out the associated field value. The most common way to categorizeevents is by source type because events generated by a particular sourcecan have the same format.

The field extraction rules stored in configuration file 712 performsearch-time field extractions. For example, for a query that requests alist of events with source type “access_combined” where the “clientip”field equals “127.0.0.1,” the query search engine would first locate theconfiguration file 712 to retrieve extraction rule 716 that would allowit to extract values associated with the “clientip” field from the eventdata 720 “where the source type is “access_combined. After the“clientip” field has been extracted from all the events comprising the“clientip” field where the source type is “access_combined,” the querysearch engine can then execute the field criteria by performing thecompare operation to filter out the events where the “clientip” fieldequals “127.0.0.1.” In the example shown in FIG. 7B, events 713-715would be returned in response to the user query. In this manner, thesearch engine can service queries containing field criteria in additionto queries containing keyword criteria (as explained above).

The configuration file can be created during indexing. It may either bemanually created by the user or automatically generated with certainpredetermined field extraction rules. As discussed above, the events maybe distributed across several indexers, wherein each indexer may beresponsible for storing and searching a subset of the events containedin a corresponding data store. In a distributed indexer system, eachindexer would need to maintain a local copy of the configuration filethat is synchronized periodically across the various indexers.

The ability to add schema to the configuration file at search timeresults in increased efficiency. A user can create new fields at searchtime and simply add field definitions to the configuration file. As auser learns more about the data in the events, the user can continue torefine the late-binding schema by adding new fields, deleting fields, ormodifying the field extraction rules in the configuration file for usethe next time the schema is used by the system. Because the data intakeand query system maintains the underlying raw data and uses late-bindingschema for searching the raw data, it enables a user to continueinvestigating and learn valuable insights about the raw data long afterdata ingestion time.

The ability to add multiple field definitions to the configuration fileat search time also results in increased flexibility. For example,multiple field definitions can be added to the configuration file tocapture the same field across events generated by different sourcetypes. This allows the data intake and query system to search andcorrelate data across heterogeneous sources flexibly and efficiently.

Further, by providing the field definitions for the queried fields atsearch time, the configuration file 712 allows the record data store 712to be field searchable. In other words, the raw record data store 712can be searched using keywords as well as fields, wherein the fields aresearchable name/value pairings that distinguish one event from anotherand can be defined in configuration file 1402 using extraction rules. Incomparison to a search containing field names, a keyword search does notneed the configuration file and can search the event data directly asshown in FIG. 7B.

It should also be noted that any events filtered out by performing asearch-time field extraction using a configuration file can be furtherprocessed by directing the results of the filtering step to a processingstep using a pipelined search language. Using the prior example, a usercould pipeline the results of the compare step to an aggregate functionby asking the query search engine to count the number of events wherethe “clientip” field equals “127.0.0.1.”

2.11. Example Search Screen

FIG. 8A is an interface diagram of an example user interface for asearch screen 800, in accordance with example embodiments. Search screen800 includes a search bar 802 that accepts user input in the form of asearch string. It also includes a time range picker 812 that enables theuser to specify a time range for the search. For historical searches(e.g., searches based on a particular historical time range), the usercan select a specific time range, or alternatively a relative timerange, such as “today,” “yesterday” or “last week.” For real-timesearches (e.g., searches whose results are based on data received inreal-time), the user can select the size of a preceding time window tosearch for real-time events. Search screen 800 also initially displays a“data summary” dialog as is illustrated in FIG. 8B that enables the userto select different sources for the events, such as by selectingspecific hosts and log files.

After the search is executed, the search screen 800 in FIG. 8A candisplay the results through search results tabs 804, wherein searchresults tabs 804 includes: an “events tab” that displays variousinformation about events returned by the search; a “statistics tab” thatdisplays statistics about the search results; and a “visualization tab”that displays various visualizations of the search results. The eventstab illustrated in FIG. 8A displays a timeline graph 805 thatgraphically illustrates the number of events that occurred in one-hourintervals over the selected time range. The events tab also displays anevents list 808 that enables a user to view the machine data in each ofthe returned events.

The events tab additionally displays a sidebar that is an interactivefield picker 806. The field picker 806 may be displayed to a user inresponse to the search being executed and allows the user to furtheranalyze the search results based on the fields in the events of thesearch results. The field picker 806 includes field names that referencefields present in the events in the search results. The field picker maydisplay any Selected Fields 820 that a user has pre-selected for display(e.g., host, source, sourcetype) and may also display any InterestingFields 822 that the system determines may be interesting to the userbased on pre-specified criteria (e.g., action, bytes, categoryid,clientip, date_hour, date_mday, date_minute, etc.). The field pickeralso provides an option to display field names for all the fieldspresent in the events of the search results using the All Fields control824.

Each field name in the field picker 806 has a value type identifier tothe left of the field name, such as value type identifier 826. A valuetype identifier identifies the type of value for the respective field,such as an “a” for fields that include literal values or a “#” forfields that include numerical values.

Each field name in the field picker also has a unique value count to theright of the field name, such as unique value count 828. The uniquevalue count indicates the number of unique values for the respectivefield in the events of the search results.

Each field name is selectable to view the events in the search resultsthat have the field referenced by that field name. For example, a usercan select the “host” field name, and the events shown in the eventslist 808 will be updated with events in the search results that have thefield that is reference by the field name “host.”

2.12. Data Models

A data model is a hierarchically structured search-time mapping ofsemantic knowledge about one or more datasets. It encodes the domainknowledge used to build a variety of specialized searches of thosedatasets. Those searches, in turn, can be used to generate reports.

A data model is composed of one or more “objects” (or “data modelobjects”) that define or otherwise correspond to a specific set of data.An object is defined by constraints and attributes. An object’scontraints are search criteria that define the set of events to beoperated on by running a search having that search criteria at the timethe data model is selected. An object’s attributes are the set of fieldsto be exposed for operating on that set of events generated by thesearch criteria.

Objects in data models can be arranged hierarchically in parent/childrelationships. Each child object represents a subset of the datasetcovered by its parent object. The top-level objects in data models arecollectively referred to as “root objects.”

Child objects have inheritance. Child objects inherit constraints andattributes from their parent objects and may have additional constraintsand attributes of their own. Child objects provide a way of filteringevents from parent objects. Because a child object may provide anadditional constraint in addition to the constraints it has inheritedfrom its parent object, the dataset it represents may be a subset of thedataset that its parent represents. For example, a first data modelobject may define a broad set of data pertaining to e-mail activitygenerally, and another data model object may define specific datasetswithin the broad dataset, such as a subset of the e-mail data pertainingspecifically to e-mails sent. For example, a user can simply select an“e-mail activity” data model object to access a dataset relating toe-mails generally (e.g., sent or received), or select an “e-mails sent”data model object (or data sub-model object) to access a datasetrelating to e-mails sent.

Because a data model object is defined by its constraints (e.g., a setof search criteria) and attributes (e.g., a set of fields), a data modelobject can be used to quickly search data to identify a set of eventsand to identify a set of fields to be associated with the set of events.For example, an “e-mails sent” data model object may specify a searchfor events relating to e-mails that have been sent, and specify a set offields that are associated with the events. Thus, a user can retrieveand use the “e-mails sent” data model object to quickly search sourcedata for events relating to sent e-mails, and may be provided with alisting of the set of fields relevant to the events in a user interfacescreen.

Examples of data models can include electronic mail, authentication,databases, intrusion detection, malware, application state, alerts,compute inventory, network sessions, network traffic, performance,audits, updates, vulnerabilities, etc. Data models and their objects canbe designed by knowledge managers in an organization, and they canenable downstream users to quickly focus on a specific set of data. Auser iteratively applies a model development tool (not shown in FIG. 8A)to prepare a query that defines a subset of events and assigns an objectname to that subset. A child subset is created by further limiting aquery that generated a parent subset.

Data definitions in associated schemas can be taken from the commoninformation model (CIM) or can be devised for a particular schema andoptionally added to the CIM. Child objects inherit fields from parentsand can include fields not present in parents. A model developer canselect fewer extraction rules than are available for the sourcesreturned by the query that defines events belonging to a model.Selecting a limited set of extraction rules can be a tool forsimplifying and focusing the data model, while allowing a userflexibility to explore the data subset. Development of a data model isfurther explained in U.S. Pat. Nos. 8,788,525 and 8,788,526, bothentitled “DATA MODEL FOR MACHINE DATA FOR SEMANTIC SEARCH”, both issuedon 22 Jul. 2014, U.S. Pat. No. 8,983,994, entitled “GENERATION OF A DATAMODEL FOR SEARCHING MACHINE DATA”, issued on 17 Mar. 2015, U.S. Pat. No.9,128,980, entitled “GENERATION OF A DATA MODEL APPLIED TO QUERIES”,issued on 8 Sep. 2015, and U.S. Pat. No. 9,589,012, entitled “GENERATIONOF A DATA MODEL APPLIED TO OBJECT QUERIES”, issued on 7 Mar. 2017, eachof which is hereby incorporated by reference in its entirety for allpurposes.

A data model can also include reports. One or more report formats can beassociated with a particular data model and be made available to runagainst the data model. A user can use child objects to design reportswith object datasets that already have extraneous data pre-filtered out.In some embodiments, the data intake and query system 108 provides theuser with the ability to produce reports (e.g., a table, chart,visualization, etc.) without having to enter SPL, SQL, or other querylanguage terms into a search screen. Data models are used as the basisfor the search feature.

Data models may be selected in a report generation interface. The reportgenerator supports drag-and-drop organization of fields to be summarizedin a report. When a model is selected, the fields with availableextraction rules are made available for use in the report. The user mayrefine and/or filter search results to produce more precise reports. Theuser may select some fields for organizing the report and select otherfields for providing detail according to the report organization. Forexample, “region” and “salesperson” are fields used for organizing thereport and sales data can be summarized (subtotaled and totaled) withinthis organization. The report generator allows the user to specify oneor more fields within events and apply statistical analysis on valuesextracted from the specified one or more fields. The report generatormay aggregate search results across sets of events and generatestatistics based on aggregated search results. Building reports usingthe report generation interface is further explained in U.S. Pat.Application No. 14/503,335, entitled “GENERATING REPORTS FROMUNSTRUCTURED DATA”, filed on 30 Sep. 2014, and which is herebyincorporated by reference in its entirety for all purposes. Datavisualizations also can be generated in a variety of formats, byreference to the data model. Reports, data visualizations, and datamodel objects can be saved and associated with the data model for futureuse. The data model object may be used to perform searches of otherdata.

FIGS. 9-15 are interface diagrams of example report generation userinterfaces, in accordance with example embodiments. The reportgeneration process may be driven by a predefined data model object, suchas a data model object defined and/or saved via a reporting applicationor a data model object obtained from another source. A user can load asaved data model object using a report editor. For example, the initialsearch query and fields used to drive the report editor may be obtainedfrom a data model object. The data model object that is used to drive areport generation process may define a search and a set of fields. Uponloading of the data model object, the report generation process mayenable a user to use the fields (e.g., the fields defined by the datamodel object) to define criteria for a report (e.g., filters, splitrows/columns, aggregates, etc.) and the search may be used to identifyevents (e.g., to identify events responsive to the search) used togenerate the report. That is, for example, if a data model object isselected to drive a report editor, the graphical user interface of thereport editor may enable a user to define reporting criteria for thereport using the fields associated with the selected data model object,and the events used to generate the report may be constrained to theevents that match, or otherwise satisfy, the search constraints of theselected data model object.

The selection of a data model object for use in driving a reportgeneration may be facilitated by a data model object selectioninterface. FIG. 9 illustrates an example interactive data modelselection graphical user interface 900 of a report editor that displaysa listing of available data models 901. The user may select one of thedata models 902.

FIG. 10 illustrates an example data model object selection graphicaluser interface 1000 that displays available data objects 1001 for theselected data object model 902. The user may select one of the displayeddata model objects 1002 for use in driving the report generationprocess.

Once a data model object is selected by the user, a user interfacescreen 1100 shown in FIG. 11A may display an interactive listing ofautomatic field identification options 1101 based on the selected datamodel object. For example, a user may select one of the threeillustrated options (e.g., the “All Fields” option 1102, the “SelectedFields” option 1103, or the “Coverage” option (e.g., fields with atleast a specified % of coverage) 1104). If the user selects the “AllFields” option 1102, all of the fields identified from the events thatwere returned in response to an initial search query may be selected.That is, for example, all of the fields of the identified data modelobject fields may be selected. If the user selects the “Selected Fields”option 1103, only the fields from the fields of the identified datamodel object fields that are selected by the user may be used. If theuser selects the “Coverage” option 1104, only the fields of theidentified data model object fields meeting a specified coveragecriteria may be selected. A percent coverage may refer to the percentageof events returned by the initial search query that a given fieldappears in. Thus, for example, if an object dataset includes 10,000events returned in response to an initial search query, and the“avg_age” field appears in 854 of those 10,000 events, then the“avg_age” field would have a coverage of 8.54% for that object dataset.If, for example, the user selects the “Coverage” option and specifies acoverage value of 2%, only fields having a coverage value equal to orgreater than 2% may be selected. The number of fields corresponding toeach selectable option may be displayed in association with each option.For example, “97” displayed next to the “All Fields” option 1102indicates that 97 fields will be selected if the “All Fields” option isselected. The “3” displayed next to the “Selected Fields” option 1103indicates that 3 of the 97 fields will be selected if the “SelectedFields” option is selected. The “49” displayed next to the “Coverage”option 1104 indicates that 49 of the 97 fields (e.g., the 49 fieldshaving a coverage of 2% or greater) will be selected if the “Coverage”option is selected. The number of fields corresponding to the “Coverage”option may be dynamically updated based on the specified percent ofcoverage.

FIG. 11B illustrates an example graphical user interface screen 1105displaying the reporting application’s “Report Editor” page. The screenmay display interactive elements for defining various elements of areport. For example, the page includes a “Filters” element 1106, a“Split Rows” element 1107, a “Split Columns” element 1108, and a “ColumnValues” element 1109. The page may include a list of search results1111. In this example, the Split Rows element 1107 is expanded,revealing a listing of fields 1110 that can be used to define additionalcriteria (e.g., reporting criteria). The listing of fields 1110 maycorrespond to the selected fields. That is, the listing of fields 1110may list only the fields previously selected, either automaticallyand/or manually by a user. FIG. 11C illustrates a formatting dialogue1112 that may be displayed upon selecting a field from the listing offields 1110. The dialogue can be used to format the display of theresults of the selection (e.g., label the column for the selected fieldto be displayed as “component”).

FIG. 11D illustrates an example graphical user interface screen 1105including a table of results 1113 based on the selected criteriaincluding splitting the rows by the “component” field. A column 1114having an associated count for each component listed in the table may bedisplayed that indicates an aggregate count of the number of times thatthe particular field-value pair (e.g., the value in a row for aparticular field, such as the value “BucketMover” for the field“component”) occurs in the set of events responsive to the initialsearch query.

FIG. 12 illustrates an example graphical user interface screen 1200 thatallows the user to filter search results and to perform statisticalanalysis on values extracted from specific fields in the set of events.In this example, the top ten product names ranked by price are selectedas a filter 1201 that causes the display of the ten most popularproducts sorted by price. Each row is displayed by product name andprice 1202. This results in each product displayed in a column labeled“product name” along with an associated price in a column labeled“price” 1206. Statistical analysis of other fields in the eventsassociated with the ten most popular products have been specified ascolumn values 1203. A count of the number of successful purchases foreach product is displayed in column 1204. These statistics may beproduced by filtering the search results by the product name, findingall occurrences of a successful purchase in a field within the eventsand generating a total of the number of occurrences. A sum of the totalsales is displayed in column 1205, which is a result of themultiplication of the price and the number of successful purchases foreach product.

The reporting application allows the user to create graphicalvisualizations of the statistics generated for a report. For example,FIG. 13 illustrates an example graphical user interface 1300 thatdisplays a set of components and associated statistics 1301. Thereporting application allows the user to select a visualization of thestatistics in a graph (e.g., bar chart, scatter plot, area chart, linechart, pie chart, radial gauge, marker gauge, filler gauge, etc.), wherethe format of the graph may be selected using the user interfacecontrols 1302 along the left panel of the user interface 1300. FIG. 14illustrates an example of a bar chart visualization 1400 of an aspect ofthe statistical data 1301. FIG. 15 illustrates a scatter plotvisualization 1500 of an aspect of the statistical data 1301.

2.13. Acceleration Technique

The above-described system provides significant flexibility by enablinga user to analyze massive quantities of minimally-processed data “on thefly” at search time using a late-binding schema, instead of storingpre-specified portions of the data in a database at ingestion time. Thisflexibility enables a user to see valuable insights, correlate data, andperform subsequent queries to examine interesting aspects of the datathat may not have been apparent at ingestion time.

However, performing extraction and analysis operations at search timecan involve a large amount of data and require a large number ofcomputational operations, which can cause delays in processing thequeries. Advantageously, the data intake and query system also employs anumber of unique acceleration techniques that have been developed tospeed up analysis operations performed at search time. These techniquesinclude: (1) performing search operations in parallel across multipleindexers; (2) using a keyword index; (3) using a high performanceanalytics store; and (4) accelerating the process of generating reports.These novel techniques are described in more detail below.

2.13.1. Aggregation Technique

To facilitate faster query processing, a query can be structured suchthat multiple indexers perform the query in parallel, while aggregationof search results from the multiple indexers is performed locally at thesearch head. For example, FIG. 16 is an example search query receivedfrom a client and executed by search peers, in accordinace with exampleembodiments. FIG. 16 illustrates how a search query 1602 received from aclient at a search head 210 can split into two phases, including: (1)subtasks 1604 (e.g., data retrieval or simple filtering) that may beperformed in parallel by indexers 206 for execution, and (2) a searchresults aggregation operation 1606 to be executed by the search headwhen the results are ultimately collected from the indexers.

During operation, upon receiving search query 1602, a search head 210determines that a portion of the operations involved with the searchquery may be performed locally by the search head. The search headmodifies search query 1602 by substituting “stats” (create aggregatestatistics over results sets received from the indexers at the searchhead) with “prestats” (create statistics by the indexer from localresults set) to produce search query 1604, and then distributes searchquery 1604 to distributed indexers, which are also referred to as“search peers” or “peer indexers.” Note that search queries maygenerally specify search criteria or operations to be performed onevents that meet the search criteria. Search queries may also specifyfield names, as well as search criteria for the values in the fields oroperations to be performed on the values in the fields. Moreover, thesearch head may distribute the full search query to the search peers asillustrated in FIG. 6A, or may alternatively distribute a modifiedversion (e.g., a more restricted version) of the search query to thesearch peers. In this example, the indexers are responsible forproducing the results and sending them to the search head. After theindexers return the results to the search head, the search headaggregates the received results 1606 to form a single search result set.By executing the query in this manner, the system effectivelydistributes the computational operations across the indexers whileminimizing data transfers.

2.13.2. Keyword Index

As described above with reference to the flow charts in FIG. 5A and FIG.6A, data intake and query system 108 can construct and maintain one ormore keyword indices to quickly identify events containing specifickeywords. This technique can greatly speed up the processing of queriesinvolving specific keywords. As mentioned above, to build a keywordindex, an indexer first identifies a set of keywords. Then, the indexerincludes the identified keywords in an index, which associates eachstored keyword with references to events containing that keyword, or tolocations within events where that keyword is located. When an indexersubsequently receives a keyword-based query, the indexer can access thekeyword index to quickly identify events containing the keyword.

2.13.3. High Performance Analytics Store

To speed up certain types of queries, some embodiments of system 108create a high performance analytics store, which is referred to as a“summarization table,” that contains entries for specific field-valuepairs. Each of these entries keeps track of instances of a specificvalue in a specific field in the events and includes references toevents containing the specific value in the specific field. For example,an example entry in a summarization table can keep track of occurrencesof the value “94107” in a “ZIP code” field of a set of events and theentry includes references to all of the events that contain the value“94107” in the ZIP code field. This optimization technique enables thesystem to quickly process queries that seek to determine how many eventshave a particular value for a particular field. To this end, the systemcan examine the entry in the summarization table to count instances ofthe specific value in the field without having to go through theindividual events or perform data extractions at search time. Also, ifthe system needs to process all events that have a specific field-valuecombination, the system can use the references in the summarizationtable entry to directly access the events to extract further informationwithout having to search all of the events to find the specificfield-value combination at search time.

In some embodiments, the system maintains a separate summarization tablefor each of the above-described time-specific buckets that stores eventsfor a specific time range. A bucket-specific summarization tableincludes entries for specific field-value combinations that occur inevents in the specific bucket. Alternatively, the system can maintain aseparate summarization table for each indexer. The indexer-specificsummarization table includes entries for the events in a data store thatare managed by the specific indexer. Indexer-specific summarizationtables may also be bucket-specific.

The summarization table can be populated by running a periodic querythat scans a set of events to find instances of a specific field-valuecombination, or alternatively instances of all field-value combinationsfor a specific field. A periodic query can be initiated by a user, orcan be scheduled to occur automatically at specific time intervals. Aperiodic query can also be automatically launched in response to a querythat asks for a specific field-value combination.

In some cases, when the summarization tables may not cover all of theevents that are relevant to a query, the system can use thesummarization tables to obtain partial results for the events that arecovered by summarization tables, but may also have to search throughother events that are not covered by the summarization tables to produceadditional results. These additional results can then be combined withthe partial results to produce a final set of results for the query. Thesummarization table and associated techniques are described in moredetail in U.S. Pat. No. 8,682,925, entitled “DISTRIBUTED HIGHPERFORMANCE ANALYTICS STORE”, issued on 25 Mar. 2014, U.S. Pat. No.9,128,985, entitled “SUPPLEMENTING A HIGH PERFORMANCE ANALYTICS STOREWITH EVALUATION OF INDIVIDUAL EVENTS TO RESPOND TO AN EVENT QUERY”,issued on 8 Sep. 2015, and U.S. Pat. Application No. 14/815,973,entitled “GENERATING AND STORING SUMMARIZATION TABLES FOR SETS OFSEARCHABLE EVENTS”, filed on 1 Aug. 2015, each of which is herebyincorporated by reference in its entirety for all purposes.

To speed up certain types of queries, e.g., frequently encounteredqueries or computationally intensive queries, some embodiments of system108 create a high performance analytics store, which is referred to as a“summarization table,” (also referred to as a “lexicon” or “invertedindex”) that contains entries for specific field-value pairs. Each ofthese entries keeps track of instances of a specific value in a specificfield in the event data and includes references to events containing thespecific value in the specific field. For example, an example entry inan inverted index can keep track of occurrences of the value “94107” ina “ZIP code” field of a set of events and the entry includes referencesto all of the events that contain the value “94107” in the ZIP codefield. Creating the inverted index data structure avoids needing toincur the computational overhead each time a statistical query needs tobe run on a frequently encountered field-value pair. In order toexpedite queries, in most embodiments, the search engine will employ theinverted index separate from the raw record data store to generateresponses to the received queries.

Note that the term “summarization table” or “inverted index” as usedherein is a data structure that may be generated by an indexer thatincludes at least field names and field values that have been extractedand/or indexed from event records. An inverted index may also includereference values that point to the location(s) in the field searchabledata store where the event records that include the field may be found.Also, an inverted index may be stored using well-known compressiontechniques to reduce its storage size.

Further, note that the term “reference value” (also referred to as a“posting value”) as used herein is a value that references the locationof a source record in the field searchable data store. In someembodiments, the reference value may include additional informationabout each record, such as timestamps, record size, meta-data, or thelike. Each reference value may be a unique identifier which may be usedto access the event data directly in the field searchable data store. Insome embodiments, the reference values may be ordered based on eachevent record’s timestamp. For example, if numbers are used asidentifiers, they may be sorted so event records having a latertimestamp always have a lower valued identifier than event records withan earlier timestamp, or vice-versa. Reference values are often includedin inverted indexes for retrieving and/or identifying event records.

In one or more embodiments, an inverted index is generated in responseto a user-initiated collection query. The term “collection query” asused herein refers to queries that include commands that generatesummarization information and inverted indexes (or summarization tables)from event records stored in the field searchable data store.

Note that a collection query is a special type of query that can beuser-generated and is used to create an inverted index. A collectionquery is not the same as a query that is used to call up or invoke apre-existing inverted index. In one or more embodiment, a query cancomprise an initial step that calls up a pre-generated inverted index onwhich further filtering and processing can be performed. For example,referring back to FIG. 13 , a set of events generated at block 1320 byeither using a “collection” query to create a new inverted index or bycalling up a pre-generated inverted index. A query with severalpipelined steps will start with a pre-generated index to accelerate thequery.

FIG. 7C illustrates the manner in which an inverted index is created andused in accordance with the disclosed embodiments. As shown in FIG. 7C,an inverted index 722 can be created in response to a user-initiatedcollection query using the event data 723 stored in the raw record datastore. For example, a non-limiting example of a collection query mayinclude “collect clientip = 127.0.0.1” which may result in an invertedindex 722 being generated from the event data 723 as shown in FIG. 7C.Each entry in inverted index 722 includes an event reference value thatreferences the location of a source record in the field searchable datastore. The reference value may be used to access the original eventrecord directly from the field searchable data store.

In one or more embodiments, if one or more of the queries is acollection query, the responsive indexers may generate summarizationinformation based on the fields of the event records located in thefield searchable data store. In at least one of the various embodiments,one or more of the fields used in the summarization information may belisted in the collection query and/or they may be determined based onterms included in the collection query. For example, a collection querymay include an explicit list of fields to summarize. Or, in at least oneof the various embodiments, a collection query may include terms orexpressions that explicitly define the fields, e.g., using regex rules.In FIG. 7C, prior to running the collection query that generates theinverted index 722, the field name “clientip” may need to be defined ina configuration file by specifying the “access_combined” source type anda regular expression rule to parse out the client IPaddress._Alternatively, the collection query may contain an explicitdefinition for the field name “clientip” which may obviate the need toreference the configuration file at search time.

In one or more embodiments, collection queries may be saved andscheduled to run periodically. These scheduled collection queries mayperiodically update the summarization information corresponding to thequery. For example, if the collection query that generates invertedindex 722 is scheduled to run periodically, one or more indexers wouldperiodically search through the relevant buckets to update invertedindex 722 with event data for any new events with the “clientip” vauleof “127.0.0.1.”

In some embodiments, the inverted indexes that include fields, values,and reference value (e.g., inverted index 722) for event records may beincluded in the summarization information provided to the user. In otherembodiments, a user may not be interested in specific fields and valuescontained in the inverted index, but may need to perform a statisticalquery on the data in the inverted index. For example, referencing theexample of FIG. 7C rather than viewing the fields within summarizationtable 722, a user may want to generate a count of all client requestsfrom IP address “127.0.0.1.” In this case, the search engine wouldsimply return a result of “4” rather than including details about theinverted index 722 in the information provided to the user.

The pipelined search language, e.g., SPL of the SPLUNK® ENTERPRISEsystem can be used to pipe the contents of an inverted index to astatistical query using the “stats” command for example. A “stats” queryrefers to queries that generate result sets that may produce aggregateand statistical results from event records, e.g., average, mean, max,min, rms, etc. Where sufficient information is available in an invertedindex, a “stats” query may generate their result sets rapidly from thesummarization information available in the inverted index rather thandirectly scanning event records. For example, the contents of invertedindex 722 can be pipelined to a stats query, e.g., a “count” functionthat counts the number of entries in the inverted index and returns avalue of “4.” In this way, inverted indexes may enable various statsqueries to be performed absent scanning or search the event records.Accordingly, this optimization technique enables the system to quicklyprocess queries that seek to determine how many events have a particularvalue for a particular field. To this end, the system can examine theentry in the inverted index to count instances of the specific value inthe field without having to go through the individual events or performdata extractions at search time.

In some embodiments, the system maintains a separate inverted index foreach of the above-described time-specific buckets that stores events fora specific time range. A bucket-specific inverted index includes entriesfor specific field-value combinations that occur in events in thespecific bucket. Alternatively, the system can maintain a separateinverted index for each indexer. The indexer-specific inverted indexincludes entries for the events in a data store that are managed by thespecific indexer. Indexer-specific inverted indexes may also bebucket-specific. In at least one or more embodiments, if one or more ofthe queries is a stats query, each indexer may generate a partial resultset from previously generated summarization information. The partialresult sets may be returned to the search head that received the queryand combined into a single result set for the query

As mentioned above, the inverted index can be populated by running aperiodic query that scans a set of events to find instances of aspecific field-value combination, or alternatively instances of allfield-value combinations for a specific field. A periodic query can beinitiated by a user, or can be scheduled to occur automatically atspecific time intervals. A periodic query can also be automaticallylaunched in response to a query that asks for a specific field-valuecombination. In some embodiments, if summarization information is absentfrom an indexer that includes responsive event records, further actionsmay be taken, such as, the summarization information may generated onthe fly, warnings may be provided the user, the collection queryoperation may be halted, the absence of summarization information may beignored, or the like, or combination thereof.

In one or more embodiments, an inverted index may be set up to updatecontinually. For example, the query may ask for the inverted index toupdate its result periodically, e.g., every hour. In such instances, theinverted index may be a dynamic data structure that is regularly updatedto include information regarding incoming events.

In some cases, e.g., where a query is executed before an inverted indexupdates, when the inverted index may not cover all of the events thatare relevant to a query, the system can use the inverted index to obtainpartial results for the events that are covered by inverted index, butmay also have to search through other events that are not covered by theinverted index to produce additional results on the fly. In other words,an indexer would need to search through event data on the data store tosupplement the partial results. These additional results can then becombined with the partial results to produce a final set of results forthe query. Note that in typical instances where an inverted index is notcompletely up to date, the number of events that an indexer would needto search through to supplement the results from the inverted indexwould be relatively small. In other words, the search to get the mostrecent results can be quick and efficient because only a small number ofevent records will be searched through to supplement the informationfrom the inverted index. The inverted index and associated techniquesare described in more detail in U.S. Pat. No. 8,682,925, entitled“DISTRIBUTED HIGH PERFORMANCE ANALYTICS STORE”, issued on 25 Mar. 2014,U.S. Pat. No. 9,128,985, entitled “SUPPLEMENTING A HIGH PERFORMANCEANALYTICS STORE WITH EVALUATION OF INDIVIDUAL EVENTS TO RESPOND TO ANEVENT QUERY”, filed on 31 Jan. 2014, and U.S. Pat. Application No.14/815,973, entitled “STORAGE MEDIUM AND CONTROL DEVICE”, filed on 21Feb. 2014, each of which is hereby incorporated by reference in itsentirety.

2.13.3.1 Extracting Event Data Using Posting

In one or more embodiments, if the system needs to process all eventsthat have a specific field-value combination, the system can use thereferences in the inverted index entry to directly access the events toextract further information without having to search all of the eventsto find the specific field-value combination at search time. In otherwords, the system can use the reference values to locate the associatedevent data in the field searchable data store and extract furtherinformation from those events, e.g., extract further field values fromthe events for purposes of filtering or processing or both.

The information extracted from the event data using the reference valuescan be directed for further filtering or processing in a query using thepipeline search language. The pipelined search language will, in oneembodiment, include syntax that can direct the initial filtering step ina query to an inverted index. In one embodiment, a user would includesyntax in the query that explicitly directs the initial searching orfiltering step to the inverted index.

Referencing the example in FIG. 15 , if the user determines that sheneeds the user id fields associated with the client requests from IPaddress “127.0.0.1,” instead of incurring the computational overhead ofperforming a brand new search or re-generating the inverted index withan additional field, the user can generate a query that explicitlydirects or pipes the contents of the already generated inverted index1502 to another filtering step requesting the user ids for the entriesin inverted index 1502 where the server response time is greater than“0.0900” microseconds. The search engine would use the reference valuesstored in inverted index 722 to retrieve the event data from the fieldsearchable data store, filter the results based on the “response time”field values and, further, extract the user id field from the resultingevent data to return to the user. In the present instance, the user ids“frank” and “carlos” would be returned to the user from the generatedresults table 722.

In one embodiment, the same methodology can be used to pipe the contentsof the inverted index to a processing step. In other words, the user isable to use the inverted index to efficiently and quickly performaggregate functions on field values that were not part of the initiallygenerated inverted index. For example, a user may want to determine anaverage object size (size of the requested gif) requested by clientsfrom IP address “127.0.0.1.” In this case, the search engine would againuse the reference values stored in inverted index 722 to retrieve theevent data from the field searchable data store and, further, extractthe object size field values from the associated events 731, 732, 733and 734. Once, the corresponding object sizes have been extracted (i.e.2326, 2900, 2920, and 5000), the average can be computed and returned tothe user.

In one embodiment, instead of explicitly invoking the inverted index ina user-generated query, e.g., by the use of special commands or syntax,the SPLUNK® ENTERPRISE system can be configured to automaticallydetermine if any prior-generated inverted index can be used to expeditea user query. For example, the user’s query may request the averageobject size (size of the requested gif) requested by clients from IPaddress “127.0.0.1.” without any reference to or use of inverted index722. The search engine, in this case, would automatically determine thatan inverted index 722 already exists in the system that could expeditethis query. In one embodiment, prior to running any search comprising afield-value pair, for example, a search engine may search though all theexisting inverted indexes to determine if a pre-generated inverted indexcould be used to expedite the search comprising the field-value pair.Accordingly, the search engine would automatically use the pre-generatedinverted index, e.g., index 722 to generate the results without anyuser-involvement that directs the use of the index.

Using the reference values in an inverted index to be able to directlyaccess the event data in the field searchable data store and extractfurther information from the associated event data for further filteringand processing is highly advantageous because it avoids incurring thecomputation overhead of regenerating the inverted index with additionalfields or performing a new search.

The data intake and query system includes one or more forwarders thatreceive raw machine data from a variety of input data sources, and oneor more indexers that process and store the data in one or more datastores. By distributing events among the indexers and data stores, theindexers can analyze events for a query in parallel. In one or moreembodiments, a multiple indexer implementation of the search systemwould maintain a separate and respective inverted index for each of theabove-described time-specific buckets that stores events for a specifictime range. A bucket-specific inverted index includes entries forspecific field-value combinations that occur in events in the specificbucket. As explained above, a search head would be able to correlate andsynthesize data from across the various buckets and indexers.

This feature advantageously expedites searches because instead ofperforming a computationally intensive search in a centrally locatedinverted index that catalogues all the relevant events, an indexer isable to directly search an inverted index stored in a bucket associatedwith the time-range specified in the query. This allows the search to beperformed in parallel across the various indexers. Further, if the queryrequests further filtering or processing to be conducted on the eventdata referenced by the locally stored bucket-specific inverted index,the indexer is able to simply access the event records stored in theassociated bucket for further filtering and processing instead ofneeding to access a central repository of event records, which woulddramatically add to the computational overhead.

In one embodiment, there may be multiple buckets associated with thetime-range specified in a query. If the query is directed to an invertedindex, or if the search engine automatically determines that using aninverted index would expedite the processing of the query, the indexerswill search through each of the inverted indexes associated with thebuckets for the specified time-range. This feature allows the HighPerformance Analytics Store to be scaled easily.

In certain instances, where a query is executed before a bucket-specificinverted index updates, when the bucket-specific inverted index may notcover all of the events that are relevant to a query, the system can usethe bucket-specific inverted index to obtain partial results for theevents that are covered by bucket-specific inverted index, but may alsohave to search through the event data in the bucket associated with thebucket-specific inverted index to produce additional results on the fly.In other words, an indexer would need to search through event datastored in the bucket (that was not yet processed by the indexer for thecorresponding inverted index) to supplement the partial results from thebucket-specific inverted index.

FIG. 7D presents a flowchart illustrating how an inverted index in apipelined search query can be used to determine a set of event data thatcan be further limited by filtering or processing in accordance with thedisclosed embodiments.

At block 742, a query is received by a data intake and query system. Insome embodiments, the query can be receive as a user generated queryentered into search bar of a graphical user search interface. The searchinterface also includes a time range control element that enablesspecification of a time range for the query.

At block 744, an inverted index is retrieved. Note, that the invertedindex can be retrieved in response to an explicit user search commandinputted as part of the user generated query. Alternatively, the searchengine can be configured to automatically use an inverted index if itdetermines that using the inverted index would expedite the servicing ofthe user generated query. Each of the entries in an inverted index keepstrack of instances of a specific value in a specific field in the eventdata and includes references to events containing the specific value inthe specific field. In order to expedite queries, in most embodiments,the search engine will employ the inverted index separate from the rawrecord data store to generate responses to the received queries.

At block 746, the query engine determines if the query contains furtherfiltering and processing steps. If the query contains no furthercommands, then, in one embodiment, summarization information can beprovided to the user at block 754.

If, however, the query does contain further filtering and processingcommands, then at block 750, the query engine determines if the commandsrelate to further filtering or processing of the data extracted as partof the inverted index or whether the commands are directed to using theinverted index as an initial filtering step to further filter andprocess event data referenced by the entries in the inverted index. Ifthe query can be completed using data already in the generated invertedindex, then the further filtering or processing steps, e.g., a “count”number of records function, “average” number of records per hour etc.are performed and the results are provided to the user at block 752.

If, however, the query references fields that are not extracted in theinverted index, then the indexers will access event data pointed to bythe reference values in the inverted index to retrieve any furtherinformation required at block 756. Subsequently, any further filteringor processing steps are performed on the fields extracted directly fromthe event data and the results are provided to the user at step 758.

2.13.4. Accelerating Report Generation

In some embodiments, a data server system such as the data intake andquery system can accelerate the process of periodically generatingupdated reports based on query results. To accelerate this process, asummarization engine automatically examines the query to determinewhether generation of updated reports can be accelerated by creatingintermediate summaries. If reports can be accelerated, the summarizationengine periodically generates a summary covering data obtained during alatest non-overlapping time period. For example, where the query seeksevents meeting a specified criteria, a summary for the time periodincludes only events within the time period that meet the specifiedcriteria. Similarly, if the query seeks statistics calculated from theevents, such as the number of events that match the specified criteria,then the summary for the time period includes the number of events inthe period that match the specified criteria.

In addition to the creation of the summaries, the summarization engineschedules the periodic updating of the report associated with the query.During each scheduled report update, the query engine determines whetherintermediate summaries have been generated covering portions of the timeperiod covered by the report update. If so, then the report is generatedbased on the information contained in the summaries. Also, if additionalevent data has been received and has not yet been summarized, and isrequired to generate the complete report, the query can be run on theseadditional events. Then, the results returned by this query on theadditional events, along with the partial results obtained from theintermediate summaries, can be combined to generate the updated report.This process is repeated each time the report is updated. Alternatively,if the system stores events in buckets covering specific time ranges,then the summaries can be generated on a bucket-by-bucket basis. Notethat producing intermediate summaries can save the work involved inre-running the query for previous time periods, so advantageously onlythe newer events needs to be processed while generating an updatedreport. These report acceleration techniques are described in moredetail in U.S. Pat. No. 8,589,403, entitled “COMPRESSED JOURNALING INEVENT TRACKING FILES FOR METADATA RECOVERY AND REPLICATION”, issued on19 Nov. 2013, U.S. Pat. No. 8,412,696, entitled “REAL TIME SEARCHING ANDREPORTING”, issued on 2 Apr. 2011, and U.S. Pat. Nos. 8,589,375 and8,589,432, both also entitled “REAL TIME SEARCHING AND REPORTING”, bothissued on 19 Nov. 2013, each of which is hereby incorporated byreference in its entirety for all purposes.

2.14. Security Features

The data intake and query system provides various schemas, dashboards,and visualizations that simplify developers’ tasks to createapplications with additional capabilities. One such application is thean enterprise security application, such as SPLUNK® ENTERPRISE SECURITY,which performs monitoring and alerting operations and includes analyticsto facilitate identifying both known and unknown security threats basedon large volumes of data stored by the data intake and query system. Theenterprise security application provides the security practitioner withvisibility into security-relevant threats found in the enterpriseinfrastructure by capturing, monitoring, and reporting on data fromenterprise security devices, systems, and applications. Through the useof the data intake and query system searching and reportingcapabilities, the enterprise security application provides a top-downand bottom-up view of an organization’s security posture.

The enterprise security application leverages the data intake and querysystem search-time normalization techniques, saved searches, andcorrelation searches to provide visibility into security-relevantthreats and activity and generate notable events for tracking. Theenterprise security application enables the security practitioner toinvestigate and explore the data to find new or unknown threats that donot follow signature-based patterns.

Conventional Security Information and Event Management (SIEM) systemslack the infrastructure to effectively store and analyze large volumesof security-related data. Traditional SIEM systems typically use fixedschemas to extract data from pre-defined security-related fields at dataingestion time and store the extracted data in a relational database.This traditional data extraction process (and associated reduction indata size) that occurs at data ingestion time inevitably hampers futureincident investigations that may need original data to determine theroot cause of a security issue, or to detect the onset of an impendingsecurity threat.

In contrast, the enterprise security application system stores largevolumes of minimally-processed security-related data at ingestion timefor later retrieval and analysis at search time when a live securitythreat is being investigated. To facilitate this data retrieval process,the enterprise security application provides pre-specified schemas forextracting relevant values from the different types of security-relatedevents and enables a user to define such schemas.

The enterprise security application can process many types ofsecurity-related information. In general, this security-relatedinformation can include any information that can be used to identifysecurity threats. For example, the security-related information caninclude network-related information, such as IP addresses, domain names,asset identifiers, network traffic volume, uniform resource locatorstrings, and source addresses. The process of detecting security threatsfor network-related information is further described in U.S. Pat. No.8,826,434, entitled “SECURITY THREAT DETECTION BASED ON INDICATIONS INBIG DATA OF ACCESS TO NEWLY REGISTERED DOMAINS”, issued on 2 Sep. 2014,U.S. Pat. No. 9,215,240, entitled “INVESTIGATIVE AND DYNAMIC DETECTIONOF POTENTIAL SECURITY-THREAT INDICATORS FROM EVENTS IN BIG DATA”, issuedon 15 Dec. 2015, U.S. Pat. No. 9,173,801, entitled “GRAPHIC DISPLAY OFSECURITY THREATS BASED ON INDICATIONS OF ACCESS TO NEWLY REGISTEREDDOMAINS”, issued on 3 Nov. 2015, U.S. Pat. No. 9,248,068, entitled“SECURITY THREAT DETECTION OF NEWLY REGISTERED DOMAINS”, issued on 2Feb. 2016, U.S. Pat. No. 9,426,172, entitled “SECURITY THREAT DETECTIONUSING DOMAIN NAME ACCESSES”, issued on 23 Aug. 2016, and U.S. Pat. No.9,432,396, entitled “SECURITY THREAT DETECTION USING DOMAIN NAMEREGISTRATIONS”, issued on 30 Aug. 2016, each of which is herebyincorporated by reference in its entirety for all purposes.Security-related information can also include malware infection data andsystem configuration information, as well as access control information,such as login/logout information and access failure notifications. Thesecurity-related information can originate from various sources within adata center, such as hosts, virtual machines, storage devices andsensors. The security-related information can also originate fromvarious sources in a network, such as routers, switches, email servers,proxy servers, gateways, firewalls and intrusion-detection systems.

During operation, the enterprise security application facilitatesdetecting “notable events” that are likely to indicate a securitythreat. A notable event represents one or more anomalous incidents, theoccurrence of which can be identified based on one or more events (e.g.,time stamped portions of raw machine data) fulfilling pre-specifiedand/or dynamically-determined (e.g., based on machine-learning) criteriadefined for that notable event. Examples of notable events include therepeated occurrence of an abnormal spike in network usage over a periodof time, a single occurrence of unauthorized access to system, a hostcommunicating with a server on a known threat list, and the like. Thesenotable events can be detected in a number of ways, such as: (1) a usercan notice a correlation in events and can manually identify that acorresponding group of one or more events amounts to a notable event; or(2) a user can define a “correlation search” specifying criteria for anotable event, and every time one or more events satisfy the criteria,the application can indicate that the one or more events correspond to anotable event; and the like. A user can alternatively select apre-defined correlation search provided by the application. Note thatcorrelation searches can be run continuously or at regular intervals(e.g., every hour) to search for notable events. Upon detection, notableevents can be stored in a dedicated “notable events index,” which can besubsequently accessed to generate various visualizations containingsecurity-related information. Also, alerts can be generated to notifysystem operators when important notable events are discovered.

The enterprise security application provides various visualizations toaid in discovering security threats, such as a “key indicators view”that enables a user to view security metrics, such as counts ofdifferent types of notable events. For example, FIG. 17A illustrates anexample key indicators view 1700 that comprises a dashboard, which candisplay a value 1701, for various security-related metrics, such asmalware infections 1702. It can also display a change in a metric value1703, which indicates that the number of malware infections increased by63 during the preceding interval. Key indicators view 1700 additionallydisplays a histogram panel 1704 that displays a histogram of notableevents organized by urgency values, and a histogram of notable eventsorganized by time intervals. This key indicators view is described infurther detail in pending U.S. Pat. Application No. 13/956,338, entitled“KEY INDICATORS VIEW”, filed on 31 Jul. 2013, and which is herebyincorporated by reference in its entirety for all purposes.

These visualizations can also include an “incident review dashboard”that enables a user to view and act on “notable events.” These notableevents can include: (1) a single event of high importance, such as anyactivity from a known web attacker; or (2) multiple events thatcollectively warrant review, such as a large number of authenticationfailures on a host followed by a successful authentication. For example,FIG. 17B illustrates an example incident review dashboard 1710 thatincludes a set of incident attribute fields 1711 that, for example,enables a user to specify a time range field 1712 for the displayedevents. It also includes a timeline 1713 that graphically illustratesthe number of incidents that occurred in time intervals over theselected time range. It additionally displays an events list 1714 thatenables a user to view a list of all of the notable events that matchthe criteria in the incident attributes fields 1711. To facilitateidentifying patterns among the notable events, each notable event can beassociated with an urgency value (e.g., low, medium, high, critical),which is indicated in the incident review dashboard. The urgency valuefor a detected event can be determined based on the severity of theevent and the priority of the system component associated with theevent.

2.15. Data Center Monitoring

As mentioned above, the data intake and query platform provides variousfeatures that simplify the developer’s task to create variousapplications. One such application is a virtual machine monitoringapplication, such as SPLUNK® APP FOR VMWARE® that provides operationalvisibility into granular performance metrics, logs, tasks and events,and topology from hosts, virtual machines and virtual centers. Itempowers administrators with an accurate real-time picture of the healthof the environment, proactively identifying performance and capacitybottlenecks.

Conventional data-center-monitoring systems lack the infrastructure toeffectively store and analyze large volumes of machine-generated data,such as performance information and log data obtained from the datacenter. In conventional data-center-monitoring systems,machine-generated data is typically pre-processed prior to being stored,for example, by extracting pre-specified data items and storing them ina database to facilitate subsequent retrieval and analysis at searchtime. However, the rest of the data is not saved and discarded duringpre-processing.

In contrast, the virtual machine monitoring application stores largevolumes of minimally processed machine data, such as performanceinformation and log data, at ingestion time for later retrieval andanalysis at search time when a live performance issue is beinginvestigated. In addition to data obtained from various log files, thisperformance-related information can include values for performancemetrics obtained through an application programming interface (API)provided as part of the vSphere Hypervisor™ system distributed byVMware, Inc. of Palo Alto, California. For example, these performancemetrics can include: (1) CPU-related performance metrics; (2)disk-related performance metrics; (3) memory-related performancemetrics; (4) network-related performance metrics; (5) energy-usagestatistics; (6) data-traffic-related performance metrics; (7) overallsystem availability performance metrics; (8) cluster-related performancemetrics; and (9) virtual machine performance statistics. Suchperformance metrics are described in U.S. Pat. Application No.14/167,316, entitled “CORRELATION FOR USER-SELECTED TIME RANGES OFVALUES FOR PERFORMANCE METRICS OF COMPONENTS IN ANINFORMATION-TECHNOLOGY ENVIRONMENT WITH LOG DATA FROM THATINFORMATION-TECHNOLOGY ENVIRONMENT”, filed on 29 Jan. 2014, and which ishereby incorporated by reference in its entirety for all purposes.

To facilitate retrieving information of interest from performance dataand log files, the virtual machine monitoring application providespre-specified schemas for extracting relevant values from differenttypes of performance-related events, and also enables a user to definesuch schemas.

The virtual machine monitoring application additionally provides variousvisualizations to facilitate detecting and diagnosing the root cause ofperformance problems. For example, one such visualization is a“proactive monitoring tree” that enables a user to easily view andunderstand relationships among various factors that affect theperformance of a hierarchically structured computing system. Thisproactive monitoring tree enables a user to easily navigate thehierarchy by selectively expanding nodes representing various entities(e.g., virtual centers or computing clusters) to view performanceinformation for lower-level nodes associated with lower-level entities(e.g., virtual machines or host systems). Example node-expansionoperations are illustrated in FIG. 17C, wherein nodes 1733 and 1734 areselectively expanded. Note that nodes 1731-1739 can be displayed usingdifferent patterns or colors to represent different performance states,such as a critical state, a warning state, a normal state or anunknown/offline state. The ease of navigation provided by selectiveexpansion in combination with the associated performance-stateinformation enables a user to quickly diagnose the root cause of aperformance problem. The proactive monitoring tree is described infurther detail in U.S. Pat. No. 9,185,007, entitled “PROACTIVEMONITORING TREE WITH SEVERITY STATE SORTING”, issued on 10 Nov. 2015,and U.S. Pat. No. 9,426,045, also entitled “PROACTIVE MONITORING TREEWITH SEVERITY STATE SORTING”, issued on 23 Aug. 2016, each of which ishereby incorporated by reference in its entirety for all purposes.

The virtual machine monitoring application also provides a userinterface that enables a user to select a specific time range and thenview heterogeneous data comprising events, log data, and associatedperformance metrics for the selected time range. For example, the screenillustrated in FIG. 17D displays a listing of recent “tasks and events”and a listing of recent “log entries” for a selected time range above aperformance-metric graph for “average CPU core utilization” for theselected time range. Note that a user is able to operate pull-down menus1742 to selectively display different performance metric graphs for theselected time range. This enables the user to correlate trends in theperformance-metric graph with corresponding event and log data toquickly determine the root cause of a performance problem. This userinterface is described in more detail in U.S. Pat. Application No.14/167,316, entitled “CORRELATION FOR USER-SELECTED TIME RANGES OFVALUES FOR PERFORMANCE METRICS OF COMPONENTS IN ANINFORMATION-TECHNOLOGY ENVIRONMENT WITH LOG DATA FROM THATINFORMATION-TECHNOLOGY ENVIRONMENT”, filed on 29 Jan. 2014, and which ishereby incorporated by reference in its entirety for all purposes.

2.16. IT Service Monitoring

As previously mentioned, the data intake and query platform providesvarious schemas, dashboards and visualizations that make it easy fordevelopers to create applications to provide additional capabilities.One such application is an IT monitoring application, such as SPLUNK® ITSERVICE INTELLIGENCE™, which performs monitoring and alertingoperations. The IT monitoring application also includes analytics tohelp an analyst diagnose the root cause of performance problems based onlarge volumes of data stored by the data intake and query system ascorrelated to the various services an IT organization provides (aservice-centric view). This differs significantly from conventional ITmonitoring systems that lack the infrastructure to effectively store andanalyze large volumes of service-related events. Traditional servicemonitoring systems typically use fixed schemas to extract data frompre-defined fields at data ingestion time, wherein the extracted data istypically stored in a relational database. This data extraction processand associated reduction in data content that occurs at data ingestiontime inevitably hampers future investigations, when all of the originaldata may be needed to determine the root cause of or contributingfactors to a service issue.

In contrast, an IT monitoring application system stores large volumes ofminimally-processed service-related data at ingestion time for laterretrieval and analysis at search time, to perform regular monitoring, orto investigate a service issue. To facilitate this data retrievalprocess, the IT monitoring application enables a user to define an IToperations infrastructure from the perspective of the services itprovides. In this service-centric approach, a service such as corporatee-mail may be defined in terms of the entities employed to provide theservice, such as host machines and network devices. Each entity isdefined to include information for identifying all of the events thatpertains to the entity, whether produced by the entity itself or byanother machine, and considering the many various ways the entity may beidentified in machine data (such as by a URL, an IP address, or machinename). The service and entity definitions can organize events around aservice so that all of the events pertaining to that service can beeasily identified. This capability provides a foundation for theimplementation of Key Performance Indicators.

One or more Key Performance Indicators (KPI’s) are defined for a servicewithin the IT monitoring application. Each KPI measures an aspect ofservice performance at a point in time or over a period of time (aspectKPI’s). Each KPI is defined by a search query that derives a KPI valuefrom the machine data of events associated with the entities thatprovide the service. Information in the entity definitions may be usedto identify the appropriate events at the time a KPI is defined orwhenever a KPI value is being determined. The KPI values derived overtime may be stored to build a valuable repository of current andhistorical performance information for the service, and the repository,itself, may be subject to search query processing. Aggregate KPIs may bedefined to provide a measure of service performance calculated from aset of service aspect KPI values; this aggregate may even be takenacross defined timeframes and/or across multiple services. A particularservice may have an aggregate KPI derived from substantially all of theaspect KPI’s of the service to indicate an overall health score for theservice.

The IT monitoring application facilitates the production of meaningfulaggregate KPI’s through a system of KPI thresholds and state values.Different KPI definitions may produce values in different ranges, and sothe same value may mean something very different from one KPI definitionto another. To address this, the IT monitoring application implements atranslation of individual KPI values to a common domain of “state”values. For example, a KPI range of values may be 1-100, or 50-275,while values in the state domain may be ‘critical,’ ‘warning,’ ‘normal,’and ‘informational’.. Thresholds associated with a particular KPIdefinition determine ranges of values for that KPI that correspond tothe various state values. In one case, KPI values 95-100 may be set tocorrespond to ‘critical’ in the state domain. KPI values from disparateKPI’s can be processed uniformly once they are translated into thecommon state values using the thresholds. For example, “normal 80% ofthe time” can be applied across various KPI’s. To provide meaningfulaggregate KPI’s, a weighting value can be assigned to each KPI so thatits influence on the calculated aggregate KPI value is increased ordecreased relative to the other KPI’s.

One service in an IT environment often impacts, or is impacted by,another service. The IT monitoring application can reflect thesedependencies. For example, a dependency relationship between a corporatee-mail service and a centralized authentication service can be reflectedby recording an association between their respective servicedefinitions. The recorded associations establish a service dependencytopology that informs the data or selection options presented in a GUI,for example. (The service dependency topology is like a “map” showinghow services are connected based on their dependencies.) The servicetopology may itself be depicted in a GUI and may be interactive to allownavigation among related services.

Entity definitions in the IT monitoring application can includeinformational fields that can serve as metadata, implied data fields, orattributed data fields for the events identified by other aspects of theentity definition. Entity definitions in the IT monitoring applicationcan also be created and updated by an import of tabular data (asrepresented in a CSV, another delimited file, or a search query resultset). The import may be GUI-mediated or processed using importparameters from a GUI-based import definition process. Entitydefinitions in the IT monitoring application can also be associated witha service by means of a service definition rule. Processing the ruleresults in the matching entity definitions being associated with theservice definition. The rule can be processed at creation time, andthereafter on a scheduled or on-demand basis. This allows dynamic,rule-based updates to the service definition.

During operation, the IT monitoring application can recognize notableevents that may indicate a service performance problem or othersituation of interest. These notable events can be recognized by a“correlation search” specifying trigger criteria for a notable event:every time KPI values satisfy the criteria, the application indicates anotable event. A severity level for the notable event may also bespecified. Furthermore, when trigger criteria are satisfied, thecorrelation search may additionally or alternatively cause a serviceticket to be created in an IT service management (ITSM) system, such asa systems available from ServiceNow, Inc., of Santa Clara, California.

SPLUNK® IT SERVICE INTELLIGENCE™ provides various visualizations builton its service-centric organization of events and the KPI valuesgenerated and collected. Visualizations can be particularly useful formonitoring or investigating service performance. The IT monitoringapplication provides a service monitoring interface suitable as the homepage for ongoing IT service monitoring. The interface is appropriate forsettings such as desktop use or for a wall-mounted display in a networkoperations center (NOC). The interface may prominently display aservices health section with tiles for the aggregate KPI’s indicatingoverall health for defined services and a general KPI section with tilesfor KPI’s related to individual service aspects. These tiles may displayKPI information in a variety of ways, such as by being colored andordered according to factors like the KPI state value. They also can beinteractive and navigate to visualizations of more detailed KPIinformation.

The IT monitoring application provides a service-monitoring dashboardvisualization based on a user-defined template. The template can includeuser-selectable widgets of varying types and styles to display KPIinformation. The content and the appearance of widgets can responddynamically to changing KPI information. The KPI widgets can appear inconjunction with a background image, user drawing objects, or othervisual elements, that depict the IT operations environment, for example.The KPI widgets or other GUI elements can be interactive so as toprovide navigation to visualizations of more detailed KPI information.

The IT monitoring application provides a visualization showing detailedtime-series information for multiple KPI’s in parallel graph lanes. Thelength of each lane can correspond to a uniform time range, while thewidth of each lane may be automatically adjusted to fit the displayedKPI data. Data within each lane may be displayed in a user selectablestyle, such as a line, area, or bar chart. During operation a user mayselect a position in the time range of the graph lanes to activate laneinspection at that point in time. Lane inspection may display anindicator for the selected time across the graph lanes and display theKPI value associated with that point in time for each of the graphlanes. The visualization may also provide navigation to an interface fordefining a correlation search, using information from the visualizationto pre-populate the definition.

The IT monitoring application provides a visualization for incidentreview showing detailed information for notable events. The incidentreview visualization may also show summary information for the notableevents over a time frame, such as an indication of the number of notableevents at each of a number of severity levels. The severity leveldisplay may be presented as a rainbow chart with the warmest colorassociated with the highest severity classification. The incident reviewvisualization may also show summary information for the notable eventsover a time frame, such as the number of notable events occurring withinsegments of the time frame. The incident review visualization maydisplay a list of notable events within the time frame ordered by anynumber of factors, such as time or severity. The selection of aparticular notable event from the list may display detailed informationabout that notable event, including an identification of the correlationsearch that generated the notable event.

The IT monitoring application provides pre-specified schemas forextracting relevant values from the different types of service-relatedevents. It also enables a user to define such schemas.

3.0 User Journeys

As described above, machine data can be ingested, for example by thedata intake and query system 108, and events produced based on themachine data. The events can be utilized to provide insight into complexcomputing systems. For example, events can be accessibly maintained inthe data stores, and queries identifying a set of data and a manner ofprocessing the data can be executed. In this way, the machine data canbe investigated (e.g., poked) via differing queries, updated fielddefinitions, and so on, to identify useful information for requestingusers.

As an example, machine data in disparate computing systems may generatedata in response to activities, interactions, triggers, and so on. Forexample, a computing system may record network access activities (e.g.,user account logins to a computing system), user activities (e.g., acomputing system may monitor user activity or user behavior), servicerelated activities (e.g., as described above with respect to Section2.16), and so on. In some cases, the disparate computing systems canrecord user interactions with the computing systems. For example, themachine data may include information indicative of a particular userinteracting with a computing system, along with further informationdescribing the interaction. Further, interaction with one computingsystem can trigger the computing system to interact with anothercomputing system, which may generate machine data in response.

These disparate computing systems may therefore generate machine datathat describes multitudes of touchpoints associated with a respectiveentity (e.g., a user, an object, a computing system, and so on). In thisspecification, a touchpoint can refer to any interaction of an entitywith a computing system, or any interaction of an entity that isrecorded by a computing system. For example, the entity may include auser, and a touchpoint may include the user accessing his/her useraccount on a particular computing system. The particular computingsystem, which may be a domain controller or active directory server, maygenerate machine data associated with the user interaction.

A second touch point may include the user account performing an actionon a user device (e.g., a laptop, computer, tablet), such as causing adownload of information to the user device or accessing a virtualprivate network (VPN). The user device may generate data associated withthis second touch point. Additionally, a call received at a call centerfrom an entity may represent a third touch point. For example, acomputing system recording received calls may generate machine data inresponse to the call from the entity.

A combination of these touchpoints may, as an example, provide usefulinformation related to interactions with one or more computing systems.With respect to the example of users accessing their respective useraccounts, additional touchpoints may include particular types ofinteractions the user accounts perform, along with a touchpointspecifying that the users logged out of their respective user accounts.In this way, the touchpoints may help form a picture of a particularuser’s utilization of an accessed user account or interaction withvarious computer systems associated with the user account. For example,a time at which the particular user accessed his/her user account, alongwith a location from which the access occurred, can be identified fromevents. Similarly, the system can identify whether the particular userperformed particular types of interactions, and then identify a time atwhich the particular user ceased accessing his/her user account.

Thus, users, or other entities, may interact with disparate computingsystems as part of an ongoing process, or journey. Being able to analyzeevents describing these interactions, and stitching them together togenerate a digestible representation of each user’s journey may bebeneficial to understand these interactions. For example, stitching(e.g., aggregating) events together can provide insights into specificpaths typically taken by users to complete a journey. As an example, ajourney may be related to processing of an application, and aggregatingevents may inform all the interactions (e.g., different paths) thatdifferent users have prior to their respective applications beingcomplete. These insights may help improve future computer interactions,for example to reduce user frictions via an understanding of typicaljourneys.

As will be described below, a user journey or journey may be definedthat includes one or more steps. For example, a journey may include aset of steps performed, or that may be performed, to implement orexecute a task or process. Each step can correspond to one or moreevents from one or more data sources. Therefore, a user journey orjourney can indicate occurrences of events across one or more disparatedata sources or data systems. In some cases, the path of a particularinstance across one or more steps of a journey, can be referred to as ajourney instance. In this manner, a journey instance can be an observedtrace of a path taken in association with a journey or process. In somecases, a journey instance can include a path through each of the stepsof a journey, and in other cases, a journey instance includes a paththrough a subset of the steps of a journey.

A system (e.g., the data intake and query system 108) can executequeries based on the steps, and provide results (e.g., in one or moreuser interfaces) to reviewing users. For example, the results canindicate occurrences of touchpoints that may occur along a user journey.To relate these results to individual entities (e.g., users), forexample touchpoints of a specific entity, the system can stitch eventstogether that are related to each entity. However, as different eventsmay include machine data generated from disparate systems, these eventsmay not be easily relatable. For example, an event describing a firsttouchpoint of a user may identify the user in a first way (e.g., a nameof the user), while an event describing a second touchpoint of a usermay identify the user in a second way (e.g., a phone number of theuser).

As will be described below, with respect to FIG. 19 , one or morestitching schemes can be utilized to relate events. As described above,each step may be associated with a particular data source. For stepsassociated with a same data source, the events which satisfy searchqueries corresponding to these steps may be rapidly relatable. Forexample, the events from this same data source that are related to asame entity may include a portion of same information. A particularfield, for example a Session ID or User ID, may include a same value forevents related to a same entity. Therefore, a stitching scheme for theseevents may specify that events including a same value for the particularfield are related to a same entity.

However, for steps associated with different data sources, the eventswhich satisfy search queries corresponding to these steps may not beimmediately relatable. A stitching scheme for these events may thereforeinclude utilization of a lookup table that correlates events associatedwith different data sources. For example, and with respect to theexample described above, a lookup table can correlate names of userswith their phone numbers. Another stitching scheme for these events mayutilize ‘gluing events,’ which can represent intermediate events thatinclude information associated with a first a data source andinformation associated with a second data source. As an example, a firstcomputing system may trigger a second computing system, and thetriggering may specify a Session ID or User ID related to an entity. Thesecond computing system may record this specified information in machinedata, and further record its Session ID or User Id. The system canexecute one or more search queries to identify these gluing events, andtherefore relate events that are associated with the first computingsystem and the second computing system.

While reference is made herein to a search query, it should beunderstood that search query can encompass any search of informationthat causes the system to determine satisfaction of particularconstraints, such as whether particular values, fields, and so on, areincluded in events. As an example, a search query may be specifiedaccording to the Splunk Processing Language (SPL) described above.

As an example of a user journey, a user journey can include stepsrelated to processing of a user application (e.g., application forparticular network credit application, job application, and so on). Forexample, a first step may be associated with receipt of an application.The first step may specify a query to identify occurrences of aparticular value for a field included in events. The field may berelated to actions performed by users, and the particular value mayreflect the action of receiving an application submitted by a user. Inthe example first step, the data sources may include informationreceived from, or generated by, computing systems at which applicationsare received. As described above, these data sources may be specified bya user creating the user journey, or optionally these data sources maybe automatically selected by the system (e.g., based on analyzing theuser journey). For the example user journey, additional steps mayfurther specify queries associated with the application’s processingand/or status. Each of these additional steps may cause application(e.g., execution) of search queries on differing data sources, such thata user’s application may be monitored across the data sources.

As will be described below, for example with respect to FIGS. 19-27 , auser can create a user journey through efficient user interfaces thatsuccinctly mask the complexities associated with analyzing millions,billions, and so on, of events produced from machine data of disparatecomputing systems. With respect to the example of an applicationdescribed above, a user can indicate data sources which include eventsdescribing status information of an application. The user can thenindicate how events correlate across data sources (e.g., stitchingschemes as described above). For example, as described above, a lookuptable can be utilized to correlate information included in events thatare associated with different data sources. Steps can then be definedfor the user journey, and, as will be described, the search queriesspecified by each step can be generated via minimal user interactionswith a user interface. Optionally, the search queries can be generatedby the user, for example, using a query language (e.g., SPL as describedabove).

As will be described, at least with respect to FIG. 21 , to improveefficiency and ease of creating user journeys, common field identifierscan be created and utilized across data sources. For example, a usercreating a user journey can indicate that a field name specific to afirst data source corresponds with a particular common field identifier.Similarly, the user can indicate that a different field name specific toa second data source also corresponds to the particular common fieldidentifier. In this way, the user can create a user journey via a set ofcommon field identifiers such that steps can be rapidly defined. Anexample common field identifier may include ‘UserID’, and the user canindicate that a first field (e.g., a field specifying user name) inevents associated with a first data source corresponds to ‘User ID’.Similarly, the user can indicate that a second field (e.g., a fieldspecifying phone number) in events associated with a second data sourcesimilarly corresponds to ‘UserID’. Therefore, the user can create stepsthat can be used to generate queries to be applied to events associatedwith different data sources, with the queries specifying the commonfield identifier ‘UserID’.

Upon creation of a user journey, the system can execute queries definedbased on information provided by steps of the journey, and relateresulting events. As will be described, at least with reference to FIGS.29 and 30 , the system can analyze events being received in real-time,or the system can analyze events previously produced and stored in datastores, including field-searchable data stores. Additionally, asdescribed below, the system, or a presentation system in communicationwith the system, can generate user interfaces for presentation on userdevices that describe the relating.

FIG. 18 illustrates an example user interface 1800 displaying a userjourney 1802. The user interface 1800 can be an example of aninteractive user interface generated, at least in part, by a system(e.g., a server system, the data intake and query system 108, and soon), and which is presented on (e.g., rendered by) a user device (e.g.,a laptop, a computer, a tablet, a wearable device). For example, theuser interface 1800 can be presented via a webpage being presented onthe user device. As another example, the webpage may be associated witha web application (e.g., executing on the data intake and query system108) that receives user input on the user device and updates inresponse. Optionally, the user interface 1800 can be generated via anapplication (e.g., an ‘app’ obtained from an electronic applicationstore) executing on a user device, and the application can receiveinformation for presentation in the user interface 1800 from an outsidesystem (e.g., the data intake and query system 108).

User interface 1800 includes a graphical depiction of an example userjourney 1802 that includes example steps 1806A-F. As described above, auser journey includes one or more steps, with each step corresponding toone or more queries to be applied to events associated with datasources. A particular entity, such as a user or object, can be monitoredas it traverses a user journey. For example, an initial eventidentifying an example user that satisfies one or more queriescorresponding to a first step may be correlated with (e.g., related to)a second event identifying the example user satisfying queriescorresponding to a second step. In this way, the example user can bedetermined to have traversed from the first step to the second step.Similarly, events identifying multitudes of users can be similarlymonitored, and related to determine which events are associated with asame user. User interface information describing results of the relatingcan be presented.

FIG. 18 illustrates summary information associated with example userjourney 1802. As illustrated, steps 1806A-F are graphically connectedvia respective visual links 1803 between the steps. These links indicatetransitions between steps, for example the visual link 1803 indicatesusers’ transitioning from step 1806A to step 1806C. Based on monitoringevents for occurrences of the steps 1806A-F, user interface 1800presents indications of a total number of users 1810 who have initiateduser journey 1802, indications of a quantity of users associated witheach step (e.g., visual element 1808 may represent a quantity of users,with the element 1808 optionally sized according to a number of usersassociated with the visual element 1808 as compared to the total numberof users 1810), and so on. Additional summary information includesaverage times associated with each step (e.g., transition between step1806A and step 1806B is illustrated as taking 44 minutes). In this way,a reviewing user can utilize the user interface 1800 to view informationotherwise buried inside complex machine data and events, via an easy todigest user interface 1800.

Optionally, the visual element 1808 can represent a single user. Asillustrated, visual element 1808 is illustrated as transitioning betweenstep 1806D and step 1806A. The example user journey 1802 may illustrateparticular steps (e.g., major steps, for example as specified by auser), but the user journey 1802 may include additional steps notillustrated. Thus, there may be steps between the illustrated steps1806D and 1806A. To determine the single user’s location along with avisual link between step 1806D and 1806A, the system can utilize anumber of remaining (e.g., uncompleted) steps between the steps 1806D,1806A. Optionally, even without these additional steps, the system canpredict that the single user is transitioning (e.g., the single user islikely to be transitioning) between the steps 1806D, 1806A, based on atime since the single user completed step 1806D. That is, the system candetermine an average time from completion of step 1806D to completion ofstep 1806A across all users, or users with that share features similarto the single user (e.g., location, demographics, historicalinformation, and so on). In this way, the system can model the visualelement’s 1808 location along a visual link based on a time since thesingle user completed step 1806D. For example, the system can identifyan event satisfying a query corresponding to step 1806D, and utilizetimestamp information included in the event.

In the example of FIG. 18 , user journey 1802 describes steps towardscompletion of creating a user account. Initial step 1806A indicatescreation of a user account, for example an event can be identified thatincludes machine data associated with the initial creation of the useraccount. The final step 1806F indicates implementation of assignednetwork access rights associated with the created user account. Asillustrated, different paths from the initial step 1806A to the finalstep 1806F are included. For example, a first path can traverse steps1806A, 1806C, 1806E, and 1806F. A second path can traverse steps 1806A,1806B, 1806C, 1806E, and 1806F. This second path differs from the firstpath in that, for at least one user, user information was obtained(e.g., step 1806B). For example, one or more events specifying theexample user may have indicated that user information was obtained(e.g., an event can indicate that a network call to a storage system wasperformed, or an event can indicate that a request for user information,such as an email, was provided, and so on). As described above, eachstep can correspond to, or be used to generate, one or more queries tobe executed, and the executed queries for step 1806B may have identifiedevents specific to the example user. In contrast, a different exampleuser who traversed the first path may have had his/her user informationentered at a time of user account creation in step 1806A.

As will be described in more detail below, with respect to FIG. 28 , anordering of the steps 1806A-F, and thus a determination of the links1803 between steps 1806A-F, can be determined by the data intake andquery system 108 based on monitoring and/or relating events. Forexample, the data intake and query system 108 can identify occurrencesof each step for a particular user, and identify a path traversing thesteps based on timestamp information. Similarly, the data intake andquery system 108 can determine alternate paths based on monitoringmultitudes of users. In this way, the data intake and query system 108can operate with limited assumptions, such that all paths between stepsthat users take can be empirically determined. As will be describedbelow, with respect to FIG. 22 , the data intake and query system 108can determine most-used paths, and further cluster entities (e.g.,users) according to paths they traverse.

The user interface 1800 further illustrates representations of users whoare transitioning between steps. For example, visual element 1808 (e.g.,the visual element can be a circle, square, an arbitrary shape orpolygon, and so on) can represent a particular number of users who havecompleted a step and are traversing to a subsequent step. Optionally,the user interface 1800 can illustrate movement of the visual elementsbetween steps. For example, an animation of the visual elementstransitioning between steps 1806A-F can be presented. Optionally, aspeed associated with the movement can be based on a measure of centraltendency of an amount of time a transition takes. As will be describedbelow, the data intake and query system 108 can monitor occurrences ofsteps, and determine statistical information associated with themonitoring. In this way, the system 108 can determine that, for example,transitioning from step 1806A to step 1806C takes 44 minutes (e.g., ameasure of central tendency of transitions can be determined to take 44minutes).

Additionally, the user interface 1800 includes textual information 1804associated with the user journey (e.g., “User Account Creation”). Thistextual information 1804 can be specified by a user creating the userjourney 1802. Optionally, the textual information 1804 may beautomatically generated by the data intake and query system 108 based onan analysis of included steps 1806A-F. As an example, utilizing machinelearning techniques the data intake and query system 108 can analyzequeries specified in the steps 1806A-F, and determine correspondingtextual information that reflects the queries. For example, the system102 can compare the queries with queries utilized in other userjourneys, to determine similar user journeys. The textual information1804 associated with these similar user journeys may be analyzed andupdated via the machine learning techniques based on the specificqueries of user journey 1802.

FIG. 19 illustrates an example process 1900 for creating a user journey.For convenience, the process 1900 will be described as being performedby a system of one or more computers (e.g., the data intake and querysystem 108).

At block 1902, the system receives information specifying data sourcesassociated with a user journey. As described above, a user journey canutilize events associated with particular data sources. For example, auser creating the user journey may be interested in particulartouchpoints (e.g., user interactions) with disparate computing systems.The user can therefore indicate data sources related to thesetouchpoints. For example, if a touchpoint is associated with an entityplacing a call to a call center, the user creating a user journey canspecify a data source that records information associated with suchcalls.

Optionally, as the system receives information specifying data sources,the system can utilize machine learning techniques to recommendadditional data sources that may be of interest to the user. Forexample, if the user specifies a data source associated with a callcenter, the system can recommend a data source storing touchpoints(e.g., user interactions) with a front-end system. The system may assumethat the user will want to understand why a call center was called, andtherefore can recommend a data source indicating specific userinteractions that led to a call being placed. That is, the front-endsystem may record machine data describing user interactions on a webpage, with the web page specifying a call number. Therefore, if a callto the call number was placed, the user creating the user journey may beinterested in the user interactions with the web page which led to thecall. The system can analyze prior created user journeys, and determineclusters of data sources which are generally utilized together. In thisway, the system can recommend data sources to the user to increase aspeed at which the user journey is created.

At block 1904, the system maps fields included in events associated withthe specified data sources to common field identifiers. Each data sourcemay include events with differing field identifiers. For example, valuesof identifying information included in events associated with a firstdata source may correspond to a different field identifier than valuesof identifying information included in events associated with a seconddata source. The system can map these different field identifiers to asame common field identifier.

As an example, and as will be described in more detail with respect toFIG. 20 , a common field identifier may relate to a step. For example, astep may optionally be defined as corresponding to values of aparticular field included in events. For example, field values for afield named ‘action’ of events associated with a particular data sourcemay indicate user interactions. Therefore, the system can receive amapping of the ‘actions’ field to a common field identifier (e.g.,“Steps” as illustrated in FIG. 20 ).

As another example, and as will be described in more detail below withrespect to FIG. 21 , a common field identifier may relate to a sessionidentifier (e.g., ‘Session ID’ as illustrated in FIG. 21 ). A sessionidentifier can indicate a particular session of an entity, and can beutilized by a computing system to reflect interactions of the entity.For example, the computing system may generate machine data that tracksinteractions of an entity using the same session identifier. To stitchevents together that relate to a particular entity, the system cantherefore identify all events that include a same session identifier.

At block 1906, the system obtains information indicating correlationsbetween data sources. As described above, and as illustrated in FIGS.24-27 , stitching schemes can be utilized to relate events from samedata sources, and also relate events across data sources. That is, todetermine whether an entity has completed a user journey, the system mayhave to relate events together to identify that the entity has completedthe user journey.

A user of the system can specify these stitching schemes. For example,the user can indicate that for events associated with a same datasource, a particular field is to be utilized to identify related events.As described above, with respect to block 1904, a particular field maybe a session identifier, and the user can specify that the sessionidentifier field be utilized to identify related events. As anotherexample, the user can indicate that a user identifier be utilized torelate events from a particular data source. For example, events fromthe particular data source may include a user name associated with aninteraction. The user can therefore specify that user name be utilizedto identify related events from the particular data source.

Additionally, to relate events associated with different data sources,the user can indicate stitching schemes for these different sources. Asan example, and as illustrated in FIG. 24 , a user interface can bepresented to the user identifying the data sources selected in block1902. The user can then specify a stitching scheme between each of theidentified data sources. For example, the user can indicate that alookup table is to be utilized between a first data source and a seconddata source. In this example, the user can specify a field in eventsassociated with the first data source that are correlated with eventsassociated with the data source via a lookup table. As another exampleof a stitching scheme, the user can indicate that a gluing event is tobe utilized to relate events from a first data source and a second datasource. In this example, the system can execute a query to identifyevents (e.g., gluing events) from, for example, the second data sourcethat include a field associated with the first data source and a fieldassociated with the second data source. Based on these identifiedevents, identifiers associated with the first data source and seconddata source can be related. Further description of a gluing event isincluded below, with respect to FIG. 28 .

The system may optionally utilize machine learning techniques todetermine a stitching scheme. For example, the system can analyze fieldidentifiers included in events associated with the selected datasources. Utilizing similarity rules (e.g., a Levenshtein distance), thesystem can determine that identifying information may be similarlylabeled (e.g., a field identifier labeled ‘processID’ in a first datasource may correspond with a field identifier labeled ‘process_ID’ or‘process identifier’ in a second data sources). Optionally, the systemcan automatically select stitching schemes utilized in prior createduser journeys. For example, the system can store information indicatingcorrelations between the data sources, and can automatically utilizestitching schemes created for prior user journeys.

At block 1908, the system obtains selections of steps to be included inthe user journey. As will be described below, with respect to FIG. 23 ,the system can present steps that are able to be selected for inclusionin the user journey. For example, the steps may have been previouslycreated. Additionally, each step may optionally be specific to aparticular data source. Therefore, the steps can correspond to values ofa particular field identifier included in events associated with aparticular data source. For example, and as described above, a fieldidentifier can be associated with user interactions or touchpoints(e.g., a field identifier ‘action’). The system can present commonvalues of this field identifier as determined from the events associatedwith the particular data source, and the user can select one or more ofthese values to correspond to steps of the user journey. Subsequently,the user can select a different data source, and select values of afield identifier as corresponding to steps for this different datasource.

In some cases, the system can recommend additional steps to the userbased on current selections of steps. That is, the system can analyzeprior created user journeys and determine clusterings of steps (e.g.,steps that are commonly included in a same user journey). The system cantherefore cause presentation of recommend steps, which the user canselect or discard.

At block 1910, the system causes application of the created userjourney. Upon selection of the steps, a user can indicate that the userjourney is to be applied to events. For example, the user journey can beapplied as will be described below with respect to FIG. 29 . It will beunderstood that fewer, more, or different steps can be included inroutine 1900. For example, the system can generate the queries for eachstep based on the information received from the user via one or moreuser interfaces.

FIGS. 20-27 illustrate user interfaces associated with creation of auser journey, for example as described in FIG. 19 . For example, FIG. 20illustrates a user interface for specifying a field included in eventsof a particular data source (e.g., “Self-Service Portal”) that is tocorrespond with a common field identifier associated with availablesteps. FIG. 21 illustrates a user interface for specifying a fieldincluded in events that is to be utilized to relate events associatedwith a same data source (e.g., “Self-Service Portal”). FIG. 22illustrates a user interface for specifying information included inevents that is to be stored when events satisfying a step’s queries arelocated. For example, if a step is related to a user adding an item to acart, FIG. 22 can be utilized to specify that for events satisfying thisstep, the system is to store an identification of the specific itemsbeing added. FIG. 23 illustrates a user interface for selecting steps tobe included in a user journey. FIGS. 24-27 illustrate user interfacesfor relating events between different data sources, for example userinterfaces to specify stitching schemes.

FIG. 20 illustrates an example user interface 2000 for identifying afield identifier whose field values are to indicate potential steps of ajourney in a particular data source. As described above, steps of a userjourney can be created, with each step being associated with atouchpoint or user interaction. In the example illustrated in FIG. 20 ,a common field identifier ‘Steps’ 2002 can represent generic steps for ajourney, and the user interface 2000 can be utilized to identify aparticular field identifier from the data source fields 2004 that ismapped to the generic step of the journey. That is, field values offield identifier selected from the data source fields 2004 can beutilized to identify occurrences of steps in a journey.

In the illustrated embodiment, the user interface 2000 includes a listof data source fields 2004 of events associated with the particular datasource (e.g., data source ‘Self-Service Portal’). A user of the userinterface 2000 can indicate which field identifier from the data sourcefields 2004 is to be used to identify steps in a journey, e.g., the datasource field 2004 whose field values correspond to steps of the userjourney. In the illustrated embodiment, the user of user interface 2000has selected field identifier ‘action’. Upon selection, user interface2000 has updated to list one or more field values 2006 associated withthe selected field identifier. That is, the data intake and query system108 identifies events associated with the particular data source, andidentifies field values included in events for the field ‘action’. Inthe illustrated embodiment, the field values for the field ‘action,’include at least: Login, Logout, Addtocart, RemoveFromCart, Checkout,viewProduct, compareProduct, Download, and ReadReview. In some cases,the field values 2006 can correspond to the most common field values forthe field ‘action’. However, it will be understood the system candetermine and display the field values 2006 using a variety oftechniques.

As described in greater detail herein with reference to FIG. 23 , a usercan select one or more of the field values 2006 as being a step in auser journey. Further, the data intake and query system 108 cangenerate, for each step, a query that identifies the field identifier‘action’ and a respective selected value of the field identifier. Inthis way, if the user later selects value ‘Login’ 2008 as a step, thedata intake and query system 108 can execute a query on eventsassociated with the particular data source that causes identification ofevents that include the value ‘Login’ 2008 for the field ‘action’.

FIG. 21 illustrates another example user interface 2100 for mapping afield identifier in a particular data source (e.g., “Self-ServicePortal”) to a common field identifier 2102. User interface 2100 enablesa user to map a specific field identifier 2104 of events associated withthe particular data source to a common field identifier 2102. In theexample, the user is mapping the specific field identifier 2104‘jsessionID’ to the common field identifier 2102 ‘Session ID’. Asdescribed above, the common field identifier 2102 ‘SessionID’ can beutilized to stitch events together into a particular user’s journey. Forexample, the common field identifier 2102 ‘SessionID’ can be utilized torelate events associated with the particular data source. As anotherexample, the user can map field identifiers included in other datasources selected for use with a user journey to the same common fieldidentifier 2102. Since field values for the common field identifier 2102‘SessionID’ in the various events or machine data can be unique, thedata intake and query system 108 can utilize the field values for thecommon field identifier 2102 ‘SessionID’ of each data source to stitchevents together as part of a particular user’s journey. For example, allevents in a data source that have the value “WC-SH-G68” for the field“jsessionID” can be mapped together as part of a particular user’sjourney.

In some embodiments, the common field identifier ‘User ID’ can beutilized to stitch events together. In some cases, the system canautomatically map a specific field identifier 2104 from the particulardata source to a common field identifier 2102. For example, the systemcan automatically map the specific field identifier 2104 “_time” for theevents associated with the particular data source with the common fieldidentifier 2102 ‘Time Stamp,’ and so forth.

FIG. 22 illustrates an example user interface 2200 for specifyinginformation that is to be recorded for a particular step. As describedabove, the system can execute queries generated based on steps andobtain events satisfying the queries. In the example of FIG. 22 , aparticular step 2202 is associated with a user interaction of adding aproduct to a cart. A user of the data intake and query system 108 maywish to record, for this particular step 2202, information associatedwith the user interaction. That is, upon identifying an event satisfyinga query associated with adding a product to a cart, the system 108 canrecord (e.g., store) relevant information included in the event (e.g.,the information can be utilized to provide context).

Accordingly, the user interface 2200 presents field identifiers 2204included in a data source that are associated with the particular step2202 “Addtocart.” A user of the user interface 2200 can select one ormore of the field identifiers 2204, indicating that values of thesefield identifiers will be recorded. In the example of FIG. 22 , the userhas selected fields ‘productID’ and ‘ProductName.’ In this way, upon adetermined occurrence of the particular step, the data intake and querysystem 108 can obtain a ‘productID’ and ‘ProductName’ associated withthe occurrence. Therefore, the system 108 can identify events associatedwith the ‘Addtocart’ 2202 step, and obtain contextual information fromthe identified events (e.g., product id and product name).

In some cases, the system can automatically record other informationrelated to the events identified in the queries, such as the fieldvalues that correspond to the common field identifiers. For example, thesystem can automatically record the time stamp of the events, the fieldvalue that corresponds to the field identifier of the data source thatwas related to the common field identifier Session ID, and so on.

FIG. 23 illustrates a user interface 2300 for selecting steps to beincluded in a user journey. As described above, with respect to FIG. 19, multiple data sources may be selected for a user journey beingcreated. For each of these data sources, one or more steps of the userjourney may be selected. That is, each step may be associated with auser interaction or touchpoint that is specific to a respective datasource.

User interface 2300 includes indications of five data sources 2302selected for a user journey (Call Center IVR, Point of Sale, Mobile App,CRM, NPS Survey). A user of the user interface 2300 has selected thedata source ‘Call Center IVR’ 2304, and the system displays the steps2306 that are available to be selected from the data source ‘Call CenterIVR’ 2304 for inclusion in the user journey. In some cases, theavailable steps 2306 can correspond to field values of a data sourcefield 2004, where the field values are included in events associatedwith the data source ‘Call Center IVR’ 2304. For example, with referenceto FIGS. 20 and 23 , the available steps 2306 (e.g., Explore Product,Compare Product, Add Product to..., Remove Product, Checkout, Changbeprofile, Add credit card) can correspond to field values of an ‘action’field in the data source ‘Call Center IVR’ 2304. For example, once auser selects the ‘action’ field in user interface 2000, the availablesteps 2304 are obtained as field values for the selected field ‘action’.In the illustrated embodiment, a user of user interface 2300 hasselected six steps 2308 for the user journey.

For the selected steps 2308 that are associated with the same datasource 2304, the system can relate the steps as described above withrespect to FIG. 21 . That is, events satisfying these steps can includethe same field value for one or more fields (e.g., the same field valuefor the field ‘jsessionID’), as they are all associated with the samedata source 2304. Therefore, the events can be related based on, forexample, Session ID or User ID as described above. For selected events2308 that are associated with different data sources, the system canrelate the steps using a variety of technique, examples of which aredescribed below with reference to FIGS. 24-27 .

FIG. 24 illustrates an example user interface 2400 for specifyingcorrelations between data sources 2402 selected for a user journey. Asdescribed above, with respect to FIG. 19 , events associated withdifferent data sources 2402 may include different information associatedwith an entity, such that determining that a first event and a secondevent from different data sources are associated with a same entity(e.g., user) can be difficult.

User interface 2400 presents a matrix 2404 specifying variouscombinations of the selected data sources 2402. A user of user interface2400 can indicate for any combination, how events associated with thecombination correlate. For example, a user has specified that eventsassociated with data source ‘Self-ServicePortal’ and events associatedwith data source ‘CC IVR’ can be correlated using a lookup table 2406.That is, to stitch events together from these data sources, the systemcan use a lookup table to translate between the identifying informationof one to the identifying information of the other. As an example,events associated with ‘Self-ServicePortal’ may specify a name of anentity, and events associated with ‘CC IVR’ may specify an address ofthe entity. A lookup table may therefore be utilized to translatebetween name and address.

FIG. 25 is a user interface 2500 illustrating a first example stitchingscheme 2502. To correlate between a first data source 2504 and a seconddata source 2506, a user of user interface 2500 has selected thestitching scheme, ‘Direct Match’. A direct match can indicate thatevents associated with the data sources 2504, 2506, include sameidentifying information, which may be found in fields having the same ora different field identifier. For example, one data source may use thefield identifier ‘username’ for a user’s full name, whereas another datasource may use the field identifier ‘userID’ for the user’s full name.Although the field identifiers are different, the field values forevents in the two systems that are related can be the same.

In the illustrated embodiment, events associated with data source 2504and events associated with data source 2506 may both include a field‘Session ID’ 2508, and the field values for the events in the differentdata source can match. Accordingly, the user can specify the fieldidentifiers ‘Session ID’ 2508 for each data source for association. Uponselection, the user interface 2500 can update with example matchingvalues 2510 associated with each field identifier 2508, to ensure that acorrect field identifier 2508 was selected. In some embodiments, whenrelating events based on a ‘Direct Match’, the system can use a varietyof techniques to identify the related events. In some cases, the systemcan determine whether the field values based on identical matches orsimilar matches using fuzzy logic. For example, the system can determinethat a field value in an event in one system of ‘David G Smith’ can berelated to an event from a different data source having ‘Dave Smith’,‘David Smith’, or David Smith’, etc.

In some embodiments, the user interface 2500 can be used to identify afield identifier in different data sources that are to correspond to thecommon field identifier 2102. For example, a user can enter a fieldidentifier for a field in the Self-Service Portal data source and acorresponding field identifier for a field in the Call Center IVR datasource that are to be used as the common field identifiers 2102 ‘SessionID’ for the respective data sources. The entered field identifiers canbe used to correlate events from different data sources as part of thesame journey.

FIG. 26 is a user interface 2600 illustrating a second example stitchingscheme 2602. To correlate between a first data source 2604 and a seconddata source 2606, a user of user interface 2600 has selected thestitching scheme, ‘Lookup Table’. As described above, a lookup table canindicate that events associated with the data sources 2604, 2606,include different field identifiers for the same or similar information.The user can specify field identifiers 2608, 2610, associated with eachdata source 2604, 2606, that include values specifying identifyinginformation. That is, to relate events from these data sources 2404,2406, a lookup table translating between values of field identifier 2608and values of field identifier 2610 is to be utilized. The user canspecify a lookup table (e.g., a network address of a lookup table, afile address, and so on) that includes information correlating betweenthe identifying information. The user interface 2600 can then update tospecify values 2612 determined to correspond to a same entity based onthe specified lookup table. In this way, a user of user interface 2600can ensure the proper field identifiers 2608, 2610, were selected.

FIG. 27 is a user interface 2700 illustrating a third example stitchingscheme 2702. To correlate between a first data source 2704 and a seconddata source 2706, a user of user interface 2700 has selected thestitching scheme, ‘Gluing event’ 2702. As described above, a gluingevent can indicate that an event specifies identifying information fromboth the first data source 2704 and the second data source 2706. Forexample, a first computing system may trigger a second computing system,and the second computing system may generate machine data that includesidentifying information received from the first computing system alongwith identifying information utilized by the second computing system. Insome cases, the data intake and query system 108 can execute a queryfrom events associated with the second data source 2706, and thereforeobtain occurrences of the handoff between the first computing system andsecond computing system. In this way, events associated with datasources 2704, 2706, can be related to a same entity. In the illustratedembodiment, a user has identified that field values of the ‘UserID’field of the ‘Self-ServicePortal’ data source 2704 correspond to fieldvalues of the ‘PreviousID’ field of the ‘Procurement System’ data source2706. As such, the system can identify a gluing event from the‘Self-ServicePortal’ data source 2704 or the ‘Procurement System’ datasource 2706 that maps a ‘UserID’ from the Self-Service Portal’ datasource 2704 to the ‘PreviousID’ of the ‘Procurement System’ data source2706. The field values for the UserID and PreviousID can then be used toidentify steps of a journey that span the two data sources 2704, 2706.

Utilizing example FIGS. 20-27 , a user can create a user journey andspecify how events are to be related (e.g., events associated with asame entity). Upon creation, the data intake and query system canexecute queries based on the steps of the user journey, and relateevents satisfying the queries. In this way, a user’s progress throughthe user journey can be monitored, and user interfaces describingresults of the user journey can be presented to a user (e.g., as will bedescribed below, with respect to FIGS. 31-36 ).

FIG. 28 illustrates a representation of steps 2802-2810 included in auser journey. As described above, steps can be included in a userjourney being created. For example, a step can be selected from apre-existing list of steps, a user can specify unique queriescorresponding to a step, a step can be automatically included based onthe data intake and query system’s 108 analysis of steps alreadyselected for inclusion (e.g., the system 108 can utilize machinelearning techniques to recommend additional steps), and so on. Thesesteps can be specific to particular data sources, for example searchqueries corresponding to the steps can be applied to events from theparticular data sources.

Panel 2800 illustrates example steps 2802-2810 that have been includedin an example journey. As described above with respect to FIG. 18 , thesteps may have no order associated with them. That is, each step may bedefined, such that events satisfying associated search queries, and thusoccurrences of each step, can be located - however, an order may not bespecified for the steps.

As the data intake and query system 108 relates events (e.g., executessearch queries corresponding to the steps 2802-2810, and relate thereturned events), the system 108 can identify occurrences of the steps2802-2810 that are associated with a same entity (e.g., user). Forexample, the system 108 can identify events that satisfy the queriesassociated with the steps 2802-2810. As described above with respect toat least FIG. 5 , each event can include a timestamp. The data intakeand query system 108 can therefore determine an order associated witheach step, based on a respective timestamp of an event satisfyingqueries corresponding to the step.

Optionally, a user may specify a particular order of one or more steps,such as an initial step and a final step. For example, particularentities may traverse through a portion of the user journey, or initiateat a different step than expected. Based on information indicating aninitial step and a final step, the data intake and query system 108 cantherefore identify that these particular entities have not completed theuser journey, or have avoided one or more initial steps.

Panel 2820 illustrates the steps 2802-2810 presented with linksspecifying paths traversed by users. For example, as the data intake andquery system 108 relates events returned as a result of application ofqueries corresponding to the steps, the system 108 can determineconnections between the steps 2802-2810. These connections can thereforeindicate a determined order associated with the steps 2802-2810. Forexample, FIG. 28 illustrates each step along with a directed linkconnecting to another step. In this way, the user journey can representa directed graph, such that differing paths can be traversed from theinitial step 2802 to the final step 2810. To determine the orderassociated with each path, the data intake and query system 108 canstitch together events associated with respective users that satisfysearch queries corresponding to the steps 2802-2810. Based on analyzingtimestamps associated with each user’s stitched together events, thedata intake and query system 108 can determine an order of the steps2802-2810 for the user.

As an example of stitching together events, the data intake and querysystem 108 can identify a first event satisfying search queriescorresponding to step B 2804. Based on analysis of the first event, thedata intake and query system 108 can identify an entity (e.g., user)specified in the first event (e.g., a value of a field associated withuser identification can be obtained). Similarly, the data intake andquery system 108 can identify additional events that satisfy searchqueries corresponding to step C 2806. The data intake and query system108 can then stitch the first event together with one of the additionalevents that specifies the same entity, for example based on a stitchingscheme.

In this example, the first event and the additional event may include afield that indicates the same value associated with user identification(e.g., a user name) or session identification (e.g., a process ID).While these fields may optionally have different identifiers (e.g.,field names), as described above with respect to FIG. 25 , the dataintake and query system 108 can store information indicating fieldidentifiers that are to be used to stitch the events.

As another example, the first event and the additional event may includerespective fields that indicate values associated with useridentification, but with values that may be different. For example, andas described above with respect to FIG. 26 , the data intake and querysystem 108 can utilize information (e.g., a lookup table) to correlatebetween values of the respective fields. As an example, a user’s name orother identifier may be included in the first event, while a user’sphone number may be included in the additional event. The data intakeand query system 108 can determine that the first event and additionalevent are associated with a same user based on the utilized information.

As an additional example, the first event and the additional event maybe stitched together via information included in an intermediate event(e.g., a ‘gluing event,’ as illustrated in FIG. 27 ). For example, thefirst event may include information specifying a user’s name. Theadditional event may include a different identifier, and no informationcorrelating the two may be obtained a priori (e.g., the system 108 maynot have access to a lookup table as described above). However, anintermediate event may include the user’s name along with the differentidentifier. The data intake and query system 108 can therefore determinethat the first event and the additional event can be stitched together,based on the intermediate event.

As a more detailed example of a gluing event, a first event may beidentified as satisfying search queries corresponding to step A 2802.This first event may be associated with a first data source, and thefirst data source may include machine data generated by a firstcomputing system. This first computing system can generate machine datathat references user names. Therefore, events produced by the dataintake and query system 108 from this machine data can include usernames referenced by a field. Similarly, a second event may be identifiedas satisfying search queries corresponding to step B 2804. This secondevent may be associated with a second, different, data source, and thesecond data source may include machine data generated by a secondcomputing system. This second computing system may record interactions(e.g., touchpoints as described above) differently than the firstcomputing system. For example, the second computing system may utilizedifferent information to identify a user.

The first computing system may provide information to the secondcomputing system, for example the first computing system may trigger aparticular action or interaction on the second computing system. Inresponse to the trigger, the second computing system may generatemachine data specifying an identifier provided with, or determined basedon, the trigger (e.g., an identifier of a user utilized by the firstcomputing system). The generated machine data may further specify anidentifier utilized by the second computing system. Therefore, thishandoff between the first computing system and the second computingsystem may specify identifiers of a same entity (e.g., user) as used bythe respective computing systems. The data intake and query system 108can produce an event that includes this generated machine data, with afirst field specifying the identifier utilized by the first computingsystem and a second field specifying the identifier utilized by thesecond computing system. Similarly, instead of user identifiers, agluing event may utilize session or process identifiers. That is, thefirst computing system may include session identifiers in machine data,and the second computing system may record these session identifiersalong with its own session identifiers.

To stitch the first event and the second event together, the data intakeand query system 108 can access information specifying respective fieldidentifiers of the first field and the second field. The data intake andquery system 108 can then analyze intermediate events (e.g., the system108 can execute a query to identify ‘gluing events’ as illustrated inFIG. 27 ) that include both the first field and the second field. Forexample, the data intake and query system 108 can analyze eventsproduced from machine data generated by the second computing system foroccurrences of the intermediate events. Upon identification of anintermediate event, the data intake and query system 108 can obtainrespective values of the first field and second field. Since thesevalues correspond to a same user, or same session, the data intake andquery system 108 can utilize the obtained values to stitch together thefirst event and second event. In this way, the data intake and querysystem 108 can determine that a same user completed step A 2802 and stepB 2804.

Each of the stitching schemes described above, may be utilized whencorrelating entities across data sources. For example, a first datasource may be correlated with a second data source according to thedirect matching scheme. Similarly, the first data source may becorrelated with a third data source according to the lookup table, orintermediate event (e.g., ‘gluing event’) schemes. For ease andefficiency of use, and as described above, a user creating a userjourney can utilize a user interface to rapidly indicate the appropriatestitching scheme. For example, FIG. 24 illustrates a user interface 2400that enables the rapid indication of stitching schemes across datasources.

Thus, since the data intake and query system 108 can monitor eachentities’ (e.g., users) traversal through the user journey, the system108 can determine one or more path’s orderings of the steps 2802-2810 asillustrated in panel 2820.

FIG. 29 is a flowchart of an example process 2900 for presenting resultsassociated with a user journey. For convenience, the process 2900 willbe described as being performed by a system of one or more computers(e.g., the data intake and query system 108).

At block 2902, the system obtains information associated with a userjourney. The obtained information can relate to steps of the userjourney, one or more queries performed as part of a step, field valuesto be extracted from events identified by the queries, etc. For example,events can be events as described above with respect to FIG. 5 .

As described above, a user journey can include steps that identifyrelevant data from one or more data sources. In some embodiments, thesystem can use the information to define or generate one or more searchqueries to be applied to events. In certain embodiments, the system canuse the information to generate one or more search queries for each stepof the user journey. Accordingly, the obtained information can include adefinition of the steps of the journey, such as steps A-N 2901 asillustrated in FIG. 29 .

As described above, a user journey can be utilized to provide arepresentation of specific interactions (e.g., touchpoints) associatedwith entities (e.g., users). Each step may therefore correspond tosearch queries that cause identification of events recording thesespecific interactions. For example, using the information from a step,the system may define a query that causes identification of eventsrecording users adding an item to a cart, or removing an item from acart. This defined query can therefore specify a particular fieldidentifier associated with user actions, along with a specific valueindicating addition, or removal, of an item from a cart. In addition,the example step may further specify one or more data sources associatedwith the events that satisfy the query. As an example, a particular datasource may produce events recording user interactions on a front-end webpage presented on user devices. For example, the events may be producedfrom machine data generated by a server system (e.g., a web applicationon the server system, a front-end module recording user interactionlogs, and so on). The example step may specify that only eventsassociated with this particular data source are to be analyzed.

Additionally, and as described above, the accessed information canindicate stitching schemes to enable correlation across data sources.For example, the user journey may optionally include steps that specifymultiple data sources. To ensure that a same entity (e.g., user) is ableto be monitored in each step, the accessed information can indicateparticular stitching schemes between the data sources. For example, theaccessed information can indicate that events associated with a firstdata source include a field identifier with same values as values of adifferent field identifier included in events associated with a seconddata source. In this way, the system does not require guarantees thatfield identifiers are utilized consistently across data sources.Similarly, utilizing a lookup table and gluing events (e.g., asdescribed above), the system can stitch events together that includeboth differing field identifiers and differing values.

Optionally, in addition to one or more search queries corresponding to astep, the step can further define information included in eventssatisfying the search queries that is to be stored. For example, anexample step may be used to generate a query that causes identificationof events recording users’ adding items to their carts. As describedabove, this example step may correspond to a query that specifies aparticular field identifier along with a value of the field identifier(e.g., a value indicating an action to add an item to a cart). Thesystem can identify events that satisfy this query, and as will bedescribed below with respect to block 2904, generate informationindicating, at least, that a user associated with each event completedthe example step. In this way, each users’ traversal through the userjourney can be monitored. In addition to this generated information, theexample step can specify that values of one or more additional fieldsare to be stored. For example, the example step can specify that valuesof a field associated with a product being added to a cart are to bestored. (e.g., the field can indicate values specifying a product name,a product identifier, a product SKU, and so on).

At block 2904, the system relates events returned as result of queries.As described above, the system executes the search queries based on thesteps to obtain events satisfying the search queries. For example, andas illustrated in FIG. 29 , the system can execute the search queries onevents stored in the data stores 2905. Optionally, these data stores2905 may be field-searchable data stores, and the system can apply alate binding schema to execute a query on the data stores 2905. In somecases, the data stores 2905 can correspond to Oracle databases, MySQLdatabases, and so on. The system can then relate events returned as aresult of these queries, for example to stitch the events as beingassociated with respective entities.

To increase efficiency and speed at which events can be returned, thesystem can optionally execute each step’s search queries in parallel.For example, if the events are stored in data stores 2905, the systemcan rapidly analyze the events according to the accessed informationdescribing the user journey. Since each step’s search queries may not bedependent on each other, that is there may be no data dependency acrosssteps, the system can rapidly execute the search queries in parallel.For any returned event, the system can generate information specifyingthe satisfied step along with an identifier of an entity associated withthe returned event (e.g., a user). In this way, the user’s traversalthrough the steps can be monitored. For example, the system can returnevents indicating that a particular user completed the user journey. Asanother example, the system can return events indicating that adifferent user completed a portion of the steps. The system can updatethis generated information as new events are produced from newlyreceived machine data. Optionally, the generated information can be aninverted index, with the inverted index referencing, for each entity,the returned events.

In certain cases, some returned events may include differing identifyinginformation. That is, a first event returned as a result of execution ofa first step’s queries may include a name associated with an entity. Thesystem can therefore generate information specifying that the entitycompleted the first step. Similarly, a second event returned as a resultof execution of a second step’s queries may include an addressassociated with an entity instead of the name. The system may thereforegenerate information specifying that an entity associated with theaddress completed the second step. Since the respective queries of thefirst step and the second step may optionally be executed in parallel, asystem may be unable to stich these two events together. However, thesystem can utilize a stitching scheme, for example as described in FIG.19 , to determine that the name of the entity, as included in the firstevent, corresponds with the address of the entity as included in thesecond event. For example, a lookup table may be stored in memory, suchthat the system can rapidly determine the correspondence. In this way,the system can stitch the first event and second event together, suchthat the system generates information specifying that the entitycompleted both the first step and the second step.

Optionally, the system may execute each step’s search queries on eventsbeing received in substantially real-time. For example, disparatecomputing systems may generate substantially real-time machine datarecording, as an example, interactions with the computing systems. Thesystem can receive this machine data, and as described above, produceevents that incorporate the machine data. As these events are produced,the system can optionally execute each step’s search queries todetermine whether the events satisfy any of the steps.

Optionally, as an event being received in substantially real-time isdetermined to satisfy a step’s search queries, the event may be modifiedto reflect that satisfaction. For example, metadata describingcompletion of the step may be generated and included in the event. As anexample with respect to a step of adding an item to a cart, the metadatacan indicate that the step associated with an adding an item to a cartwas completed. For ease of reference, an inverted index associated witha user identified in the event can be updated to reference the event. Inthis way, the system can monitor and update the inverted index todetermine the user’s status with respect to completion of the userjourney. That is, the events referenced in the inverted index can bemodified to reflect respective steps that were completed. In this way,the system can access the inverted index for a particular user, andbased on the references to events, rapidly identify the steps completedby the particular user.

Furthermore, an inverted index can be utilized to reference all eventsthat indicate some, or all, user interactions (e.g., touchpoints) ofeach user, thereby creating a timeline of touchpoints. For example, theuser interactions may be associated with steps of one or more userjourneys. A user of the system may request, for example via a userinterface as illustrated in FIG. 36 presented on his/her user device,that all touchpoints of a specified user be presented in the userinterface. The system can therefore access the inverted index associatedwith the specified user and present information obtained from thereferenced events. For example, the system can present times at whichthe touchpoints occurred (e.g., based on respective timestamps includedin the events), along with information identifying the touchpoints.Similarly, and as illustrated in FIG. 27 , a user of the system mayrequest that specified touchpoints of a specified user be presented.

While relating the returned events, as described above, the system candetermine statistical information associated with the steps. Forexample, based on timestamps included in the events, the system candetermine an average (e.g., measure of central tendency) time that ittakes to transition between the steps. As an example, the system candetermine an average time for a user to add a product to a cart and thencheckout. Alternatively, if the user removed the item from his/her cart,the system can determine an average time that the user has the productin his/her cart prior to removal. Similarly, the system can determine anaverage time that it takes users to complete all steps included in theuser journey.

Optionally, the user journey may include differing versions, and eachversion may be monitored. For example, a designer may modify a web pagethat is presented to a first set of users, while retaining an originaldesign of a web page that is presented to a second set of users. Thedesigner may desire to understand whether the modified web page resultsin a faster average time for users to transition from adding a productto a cart, to checking out. To discriminate between the modified webpage and the original web page, each event associated with the web pagemay be tagged as either the modified web page or the original web page.As an example, a computing system may provide machine data (e.g., logdata specifying whether a user received the modified or original webpage) to the system. The system can produce events from the receivedmachine data, as described above with respect to FIG. 5 , and caninclude a field indicating whether a user received the original ormodified web page. The system can then determine statistical informationassociated with each version of the user journey. In this way, thedesigner can obtain empirical information related to his/her designchoice.

At block 2906, the system causes display of at least a portion of theresults. Example user interfaces describing results of the relating aredescribed below, and illustrated in FIGS. 31-36 . As described above,with respect to FIG. 18 , these user interfaces can be presented on userdevices of users. For example, the system can respond to requests fromusers of the system, and cause display of easy to understand informationbased on the requests.

FIG. 30 is a flowchart of another example process 3000 for presentingresults associated with a user journey. For convenience, the process3000 will be described as being performed by a system of one or morecomputers (e.g., the data intake and query system 108, a server systemin communication with disparate computing systems that generate machinedata).

At block 3002, the system accesses information associated with a userjourney. As illustrated in FIG. 30 , information describing a userjourney 3001 can be accessed. Similar to the description of FIG. 29 ,the example user journey 3001 may include multiple steps eachcorresponding to one or more search queries. As will be described below,these search queries may be applied (e.g., executed) to identify eventsthat satisfy the search queries.

The example user journey 3001 further indicates that a particular stepincludes one or more sub-steps. That is, the particular step is a nesteduser journey that defines sub-steps that are completed as part of theparticular step. As illustrated, ‘Step N’ includes Sub-steps A-N, witheach sub-step corresponding to respective search queries. Similar to auser journey, the sub-steps of a nested user journey can specifymultiple data sources. That is, sub-step A may be defined as searchingfor machine data stored in a first data source, while sub-step N may bedefined as searching for machine data stored in a second data source. Inthis way, a user creating a user journey can build off of prior createduser journeys by incorporating them into the user journey as nested userjourneys represented as single steps including sub-steps. A graphicalrepresentation of a user journey that includes a nested user journey isdescribed below, and illustrated in FIG. 34 . While a nested userjourney is described with respect machine data in FIG. 30 , a nesteduser journey may similarly be utilized with events (e.g., events asdescribed above with respect to FIG. 29 ).

At block 3004, the system relates machine data returned as results ofthe queries generated based on the user journey. As similarly describedabove, with respect to FIG. 29 , the system can access data stores 3005storing the machine data and relate returned machine data (e.g., relatethe machine data as being associated with respective entities). Forexample, the data stores 3005 can be oracle databases, MySQL databases,field-searchable data stores, and so on. Optionally, the system maygenerate one or more database tables for each entity identified in thereturned machine data. For example, as a particular user is identifiedin returned machine data (e.g., associated with completion of a step),the system can generate a database table that records informationincluded in the machine data. With respect to this example, ifsubsequent machine data identifies the particular user (e.g., associatedwith completion of a different step) is returned, the system can updatethe generated database table to record information included in thesubsequent machine data. In this way, the system can maintain eachentity’s status with respect to the user journey. Optionally, the systemcan maintain a database table associated with each step, and can record(e.g., in respective rows) information included in machine data returnedas a result of executing search queries corresponding to the step.

With respect to the nested user journey that includes sub-steps A-N, thesystem can relate machine data returned as a result of executing thesearch queries corresponding to the sub-steps. Optionally, if all of thesub-steps are indicated as being completed for a particular entity, thesystem can store information indicating completion of the nested userjourney. For example, the system can update a database table generatedfor the particular entity to indicate completion of the nested userjourney. Optionally, if sub-step N is determined to be completed for theparticular entity, the system can update the database table to indicatecompletion of the nested user journey. That is, the system mayoptionally assume that completion of the final sub-step indicatescompletion of the nested user journey. As described above, with respectto FIG. 28 , steps included in a user journey may be defined withoutrespect to order. As the system relates events or machine data, thesystem can identify a traversal order of the steps that each entitytook. The system may therefore identify that sub-step N corresponds to afinal step based on monitoring historical information associated withthe nested user journey. For example, the system can determine thatsub-step N corresponds to a final step. Additionally, and as describedabove with respect to FIG. 28 , a user who creating the nested userjourney may have specified that sub-step N corresponds to a final step.Therefore, the system can identify that machine data returned as aresult of executing search queries corresponding to sub-step N,indicates completion of the nested user journey.

As described above with respect to FIG. 29 , machine data associatedwith a same entity may include different identifying information.Therefore, the system can utilize one or more stitching schemes tostitch this machine data together. For example, first machine data maybe returned as satisfying one or more search queries corresponding to afirst step, and second machine data may be returned as satisfying searchqueries corresponding to a second step. As described above the firstmachine data and second machine data may include different values forrespective fields associated with identification information. The systemcan utilize, for example, a database table specifying correlationsbetween values of these respective fields to identify a particularentity that is associated with both the first and the second machinedata. Optionally, a database table generated for this particular entitymay be updated to include information from the first machine data andthe second machine data.

At block 3006, the system causes display of at least a portion of theresults. As described above, with respect to FIG. 29 , the system candisplay results of the relating performed on the machine data. Forexample, the user interfaces described in FIGS. 31-36 can be examples ofuser interfaces presented in response to the relating.

FIG. 31 illustrates an example user interface 3100 that includes a userjourney 3102 and information indicating clusters associated with theuser journey. As described above, an entity may traverse through stepsincluded in a user journey according to different paths. The system canmonitor these different paths, and determine a frequency with which eachof the paths is followed. Additionally, the system can determine alikelihood associated with an entity (e.g., user) following one of thepaths.

As illustrated in FIG. 31 , a user interface 3100 includes a userjourney 3102 and steps of the user journey. As similarly described abovewith respect to FIG. 18 , the user journey 3102 further illustrates aquantity of entities transitioning between each of the steps (e.g., asrepresented by visual elements 3106). On the right of the user interface200 includes a clustering 2204 of entities along with a likelihood ofany entity being included in the cluster (e.g., the likelihood canrepresent how common a particular path is). As described above, acluster of entities can represent entities who traversed a same paththrough a user journey. As illustrated, a user of the user interface3100 has selected the first two clusters, and in response the userinterface 3100 can update the user journey 3102 to present informationassociated with entities of the first two clusters. For example, aquantity of the entities traversing the user journey can be presented.Additionally, an average time for transitioning between each step can bepresented, with the average time being determined based on entitiesincluded in the selected clusters 3104.

Optionally, the user journey 3102 presented in user interface 3100 mayinclude only steps that were traversed by entities included in theselected clusters 3104. For example, the presented steps may have beendetermined (e.g., by the data intake and query system 108) to beincluded in paths traversed by the entities included in the selectedclusters 3104. If a user of the user interface 3100 selects one or moreadditional clusters (e.g., cluster 3), the user interface 3100 mayupdate to present one or more additional steps traversed by entities inthe additional clusters.

FIG. 32 illustrates an example user interface 3200 presenting summaryinformation associated with a user journey. Based on executing queriesand relating returned events, for example as described above withrespect to FIG. 29 , the data intake and query system 108 can determinesummary information associated with each user journey. As illustrated,the system 108 has determined an average number 3202 of entities (e.g.,users) who are traversing an example user journey per day. The userinterface 3200 also includes statistical information related to the userjourney. For example, the statistical information includes an indicationof an empirically determined initial step 3204 in the user journey.Additionally, the statistical information indicates a percentage 3206 ofentities who completed at least one step of the user journey, but whohave since dropped out from the user journey. Major steps 3208 areillustrated, which as described above with respect to FIG. 18 , canrepresent milestones that are to be depicted on a graphicalrepresentation of the user journey or optionally a step that is a nesteduser journey. Additional steps may be included between the major steps3208.

User interface 3200 further includes a number of policy violations 3210(e.g., “18” violations in the example). A user (e.g., a user creatingthe user journey) can specify particular constraints or potentialoccurrences that are to be monitored, and if detected, are to beindicated as a policy violation. For example, a policy violation canrepresent a particular step taking longer than a set amount of time tocomplete, or a transition between two steps (e.g., completion of bothsteps) taking longer than a set amount of time. As another example, apolicy violation can represent a user following a particular path (e.g.,a user completing a first step and then completing a second step, whichthis order being disfavored or other thought to be disallowed).

FIG. 33 illustrates another example user interface 3300 presentingsummary information associated with a user journey. The user interface3300 indicates real-time information associated with the user journey.For example, the user interface 3300 presents a count 3302 associatedwith entities traversing the user journey, along with a count associatedwith entities in each event. For example, to identify a count of usersin a step, the data intake and query system 108 can obtain indication ofa last known step for the users. Additionally, user interface 3300includes average wait times 3304 of the user journey. As an example, await time 3304 can indicate an amount of time subsequent to completionof a step, that completion of a subsequent step is detected.Additionally, the user interface 3300 indicates a throughput 3306associated with each step, with the throughput representing a number ofusers completing the step per unit of time (e.g., hour).

FIG. 34 illustrates an example user interface 3400 presenting a nesteduser journey 3404 included in a user journey 3402. As described above, astep of a user journey can include sub-steps, with the sub-stepsdefining a nested user journey. Nested user journeys can enable therapid creation of user journeys through re-use of previously createduser journeys. That is, a user of the data intake and query system 108can utilize previously created steps, user journeys, and so on, asbuilding blocks to create a new user journey.

As illustrated in FIG. 34 , a user journey 3402 that includes steps ispresented. Each of the steps is presented along a horizontal linerepresenting the user journey 3402. The user interface 3405 can respondto selections of steps, and present detailed information related to thestep. For example, upon selection of step 3406A, the user interface 3400can update to indicate a time at which an entity (e.g., user ‘Tula’)completed the step 3406A. Additionally, the user interface 3400 canpresent an event or other information that was returned as a result ofexecution of one or more search queries corresponding to the step 3406A,or the information from the event that was stored per the user journey.

In the example of FIG. 34 , a user of user interface 3400 has selectedstep 3406B. Upon selection, the user interface 3400 has updated toindicate the sub-steps 3408A-C included in the step 3406B. That is, step3406B is illustrated as being a nested user journey 3404. Times at whichthe entity completed the sub-steps of the nested user journey 3404 arespecified in user interface 3400. As described above, each of the stepsshown can correspond to one or more events that were identified as aresult of the system 108 executing a query. Similarly, each of thedisplayed steps of the journey can correspond to one or more events thatwere identified as a result of the system 108 executing a query.

User interface 3400 further indicates an ID 3410, which can represent aunique identifier associated with a user journey. As described above,different versions of a user journey can be created, and results fromeach version can be analyzed. Additionally, each user journey may beassociated with a unique identifier such that it can be monitored by thedata intake and query system 108. An entity 3412 is identified (e.g.,user ‘Tula Otten’), along with a start step 3414 and end step 3416. Thestart step 3414 can represent an initial step satisfied by the entity3412, and the end step 3416 can represent a final step completed by theentity. Additionally, an average time gap 3420 can be determined (e.g.,an average time between completion of the steps), along with a longestgap.

FIG. 35 illustrates an example user interface 3500 indicating a path3504 a particular entity 3502 took through steps included in a userjourney, which may also be referred to herein as a journey instance. Asillustrated, steps of a user journey are presented, along withindications of a time the entity 3502 took to transition between thesteps. The illustrated steps represent the particular steps that theentity 3502 completed. That is, in contrast to FIG. 18 which illustratesall paths traversed by any entity for a user journey, FIG. 35 presentsthe specific path 3504 that entity 3502 traversed through the userjourney. This path 3504 is indicated in user interface 3500, as per thepath frequency 3506 portion, as having been traversed by a particularnumber of all users (e.g., 25% of users). A user of the user interface3500 can search for a particular entity, and the data intake and querysystem 108 can analyze its related event information (e.g., as describedin, at least, FIG. 29 ) to present a path traversed by the searchedentity.

FIG. 36 illustrates an example user interface 3600 presentingtouchpoints 3602 associated with a particular entity 3604. As describedabove, each step may represent a particular touchpoint of an entity withrespect to disparate computing systems. For example, the touchpoint canrepresent a user interaction being recorded by a computing system. Atimeline of touchpoints can be generated by the data intake and querysystem 108, for example touchpoints across user journeys.

As illustrated, touchpoints 3602 of a particular entity 3604 arepresented. These touchpoints 3602 are based on a total number of userjourneys associated with the particular entity 3602 (e.g., 145 userjourneys). For example, the total number can include user journeysstarted (e.g., the particular entity 3604 satisfied at least one step),or include user journeys completed (e.g., the particular entity 3604completed a final step, for example as described in FIG. 28 ). Asdescribed above, with respect to FIG. 29 , particular touchpoints (e.g.,user interactions) can be specified to be monitored by the data intakeand query system 108. In this way, a timeline of the specifiedtouchpoints can be presented.

In the example of FIG. 36 , touchpoints 3602 are specified along withparticular times 3606 at which the touchpoints were recorded. Forexample, user interface 3600 presents a visual element 3608 asrepresenting a recorded touchpoint. A user of user interface 3600 canselect the visual element 3608, and the user interface 3600 can updateto specify detailed information related to this touchpoint. For example,the user interface 3600 can present a time at which the touchpoint wasrecorded (e.g., an event including information related to thistouchpoint can be presented).

3.1 Generating and Analyzing Journey Instances

As described herein, a computing system can generate machine data inresponse to touchpoints or interactions that it has with users, othercomputing systems, or other entities. The machine data may includeinformation indicative of a particular user (or system) interacting withthe computing system, along with further information describing theinteraction. Furthermore, the interaction with the computing system cantrigger that computing system to interact with another computing system,which may generate its own set of machine data in response.

The machine data generated by various computing systems can be ingested,for example by the data intake and query system 108, which can produceevents based on the machine data. The events can be utilized to provideinsight into the complex computing system environments. For example, theevents can be accessibly maintained in data stores, and queriesidentifying a set of data and a manner of processing the data can beexecuted. In this way, the machine data can be investigated (e.g.,poked) via differing queries, field definitions updated, and so on, toidentify useful information related to the computing systems and users.

In some cases, multiple interactions with one or more computing systems,and the machine data generated in response thereto, can be related. Forexample, during a single session of a user, multiple events can begenerated that each relate to the user or session. In some cases, theseevents can be generated by one computing system or by multiple similaror heterogeneous computing systems.

A combination of these related interactions and associated machine data(or events) may be referred to herein as a journey instance. A journeyinstance generally refers to a particular or observed path taken inrelation to a journey or process. Thus, a journey instance can includeone or more events or step instances that relate to a particular user,session, entity, or the like. Further, the events or step instances ofthe journey instance can be generated by the same or different datasources or computing systems and have the same or heterogeneous dataformats. Therefore, a journey instance can indicate occurrences ofevents across one or more disparate data sources or data systems. Thisincludes occurrences of events across heterogeneous data sources and/orheterogeneous data systems.

A journey instance can provide useful information related to thefunctioning and operation of the one or more computing systems. Forexample, a journey instance can provide useful information regarding howa user, system, or other entity interacts with, e.g., “contacts” or“touches,” a computer system or set of computer systems. In addition, insome cases, a journey instance may help form a picture of a particularuser’s utilization of a user account or interaction with variouscomputer systems associated with the user account. In variousimplementations, journey instances may include information regardingtime spent interacting with various computer systems.

In some cases, a set or collection of journey instances can provideuseful information related to the functioning and operation of the oneor more computing systems. In this regard, multiple journey instancesassociated with a journey may be aggregated and utilized to provideinformation related to the journey. Multiple journey instances (e.g.,multiple groupings of related events or machine data), may help form apicture of the system’s utilization rate, efficiency, or help identifythe cause of an error. In addition, multiple journey instances can forma picture of common interactions (and a sequence of those actions) thata computing system has with users. For example, multiple journeyinstances may be used to determine the most common, relatively,interactions (and a sequence of those actions), or to determineinteractions that happen infrequently.

As such, in some cases, the system 108 can combine multiple journeyinstances to generate a journey flow visualization. The journey flowvisualization can represent the various flow paths associated withjourney instances corresponding with a journey. The journey flowvisualization can include steps that correspond to all, or a subset, ofthe step instances (which may be ordered temporally or otherwise) foundwithin any one of the journey instances and can indicate the variouspaths that the journey instances take through the steps. Thus, while asingle journey instance can indicate a particular path through aparticular group of steps (based on the step instances of the journeyinstance), which may not be all of the steps in a set of data, thejourney flow visualization can, in some embodiments, indicate thevarious paths taken through any step(s) found within the set of data.

Moreover, where a journey instance can include a particular sequence ofstep instances related together based on a pivot ID, user, or entity, ajourney flow visualization can include a particular number of steps(ordered or unordered) without relation to a particular pivot ID, user,or entity. In this way, a journey instance can be an instance,representation, or example of a journey, and a step instance can be aninstance, representation, or example of a step of the journey.

In certain embodiments, a journey can be generated by identifying one ormore related steps or events with or without combining journeyinstances. In some cases, a user can identify certain events as stepswithin a journey and/or identify certain values within events asindications of a step within a journey. For example, a user can identifya field associated with events as a step identifier and identify eachunique field value (or a selected subset of the field values) of theidentified field as a step in a journey. Similarly, if multiple fieldsare identified as step identifiers (across one or more data sources),the unique field values across the identified fields (or a selectedsubset of the field values) can be identified as steps in the journey.In addition, in certain cases, a user may specify a preferred orexpected order of the steps, which can be used to order the steps of thejourney. In some cases, one or more journey instances can be used todetermine the order of steps of a journey. Accordingly, in someembodiments, a journey can include an ordered or unordered set of steps.Thus, the journey can be an ordered journey or an unordered journey. Theordered journey can include a set of steps ordered in a particular way.The unordered journey models can include a set of steps, but may notinclude a particular order for the steps.

As will be appreciated by one of skill in the art in light of thedescription above, the embodiments disclosed herein substantiallyincrease the ability of computing systems, such as the data intake andquery system, to process related data from one or more disparate datasources or computing systems that generate heterogeneous machine data.Specifically, the embodiments disclosed herein enable the data intakeand query system to parse heterogeneous machine data across disparatecomputing systems to identify and group related events and to generatevisualizations of the related machine data to facilitate understandingof the system topology and the interactions with and between disparatecomputing systems. The aforementioned features enable the system toreduce the computing resources used to correlate heterogeneous dataacross disparate computing systems. Thus, the presently disclosedembodiments represent an improvement in the functioning of such dataintake and query systems. Moreover, the presently disclosed embodimentsaddress technical problems inherent within computing systems;specifically, the limited capacity of computing systems to parse andcorrelate machine data from one or more disparate computing systems, aswell as the limited ability of such systems to generate visualizationsof correlated data in a manner that facilitates the understanding of theunderlying computing topology and interactions between and withdisparate computing systems. These technical problems are addressed bythe various technical solutions described herein, including theutilization of particular data structures and computing resources toidentify related data across one or more disparate computing systems andparticular data structures to indicate the relationship of the data.Thus, the present application represents a substantial improvement onexisting data intake and query systems and computing systems in general.

The ability to analyze and relate individual events to generate journeyinstances and/or journey flow visualizations facilitates theunderstanding of the complex interactions that take place across one ormore computing systems, and allows visualization, analysis, and/orinferences from the journey instances and/or the data underlying thejourney instances.

FIG. 37 is a flow diagram illustrating an embodiment of a routine 3700implemented by one or more computing devices in a networked computerenvironment 100 for generating a journey instance(s). For example, theroutine 3700 can be implemented by a client device 102, host device 104,and/or any one, or an combination, of the components of the data intakeand query system 108. However, for simplicity, reference below is madeto the system 108 performing the various steps of the routine 3700.

At block 3702, the system identifies a set of data, which can includeevents. The system can identify the set of data, for example, based onthe execution of a query. A query can include one more commands orfilters to identify a set of data, which can include events. Forexample, the query can identify one or more time constraints or timeranges, one or more data sources, one or more fields or field values,etc. Based on the filters or commands in the query, the system canidentify events that satisfy the filters or commands. For instance, ifthe query identifies one or more data sources, the system can identify aset of data from the one or more data source and/or exclude data orevents from data sources not identified by the query. Similarly, thesystem can, using the query, identify a set of data that satisfies oneor more time constraints or ranges, or identify events with a particularfield or field value. In some embodiments, the system can receive thequery via one or more user interfaces. In certain embodiments, the queryis in search processing language, or can be generated based on aselection of one or more icons in a user interface. In some embodimentsthe query can be based on a data stream identified by user. The datastream can include events from one or more data sources, etc.

As described herein, the events of the set of data can include rawmachine data associated with a timestamp. In some embodiments, theevents can be derived from or based on machine data and be associatedwith heterogeneous data source having heterogeneous formats. In certainembodiments, the events can include performance information for metricsinformation.

At block 3704, the system receives one or more pivot identifiers. Insome embodiments, the system can receive one or more pivot identifiersvia a user interface. For example, with reference to FIG. 38 , a usercan specify a pivot identifier(s) via input box 3802. However, it willbe understood that the system can receive the pivot identifier in avariety of ways. The pivot identifier(s) can be used to relate,identify, or otherwise associate sets of events. As described herein, insome cases, the pivot identifier can correspond to a field associatedwith the set of data or events of the set of data. The system can usethe field, or pivot ID field, to identify the sets of events. Forexample, the system can relate events with the same field value for thepivot ID field as a set of events.

In some embodiments, the system can identify a set of events based onmultiple pivot identifiers. In some cases, the set of events identifiedbased on multiple pivot identifiers can correspond to events frommultiple data sources. For example, the system can identify a firstgroup of events from a first data source that have a first field valuefor a first pivot ID field and the second group of events from seconddata source that have a second field value for the second pivot IDfield. Based on one or more gluing events that include the first fieldvalue and the second field value, the system can identify a relationshipbetween the first field value and the second field value. Based on theidentified relationship between the first field value and the secondfield value, the system can relate the first group of events and thesecond group of events as a set of events. In some embodiments, multiplegluing events in a particular data source can be used to relate eventsthat do not have a gluing event in common or are not otherwiserelatable. For example, a first gluing event can be used to relateevents in Group A and Group B and a second gluing event can be used torelate events in Group B and Group C. As such, events in Group A andGroup C can be related without a gluing event that links them directly.The different groups of events may correspond to events from the same,similar, or heterogeneous data sources.

In some cases, the one or more gluing events can be found in the firstgroup of events or the second group of events. Further, in someinstances, a gluing event may have the first field value in a locationcorresponding to the first field, and may have the second field value ina location that does not correspond to the second field (or may not havethe second field). Accordingly, in some instances, the system canperform a search on the event or consult a keyword entry of an invertedor keyword index to identify the second field value in the gluing event.

In certain cases, multiple pivot identifiers can be used to identify aset of events and a nested set of events that are interrelated. Forexample, the system can identify a first group of events that have afirst field value for a first pivot ID field and a second group ofevents that have a second field value for a second pivot ID field. Insome cases, events in the first group may also have the second fieldvalue for the second pivot ID field and/or events in the second groupmay also have the first field value for the first pivot ID field.Further, the events in the first group and the events in the secondgroup may be associated with the same data source.

In some cases, the events of the second group may occur as a result ofthe occurrence of an event in the first group. For example, theoccurrence of a particular event may spawn one or more sub processesthat results in one or more events (also referred to as dependentevents), which can be identified using a separate pivot ID. Thedependent events may or may not include the same field value for thefirst pivot ID field, and may also share the same field value for adifferent pivot ID field.

Based on one or more gluing events that include the first field valueand the second field value, the system can identify relationship betweenthe first field value and second field value. Based on the identifiedrelationship, the system can relate the first group of events with thesecond group of events as a set of events. Further, based on anidentification of a relationship between the dependent events and theparent event, the system can determine that the second group of eventscorresponds to a nested set of events or a nested journey instance.

At block 3706, the system receives one or more step identifiers. In someembodiments, the system can receive one or more step identifiers via auser interface. For example, with reference to FIG. 38 , a user canspecify a step identifier(s) via input box 3804. However, it will beunderstood that the system can receive the step identifier in a varietyof ways.

The step identifier(s) can be used to categorize events as one or moresteps or step instances and/or group the sets of events as one or moresubsets of events. As described herein, in some cases, the stepidentifier can correspond to a field associated with the set of data orevents. The system can use the field to categorize the events and/orgroup events in a set of events into one or more subsets of events. Insome cases, the system can use the step identifier to identify a journeyor to identify steps of a journey. In certain embodiments, theidentified steps can form an unordered journey. Further, in some cases,based on user input or based on one or more journey instances, thesystem can build an ordered journey from the unordered journey.

As described herein, in some cases, the field values of the step IDfield can be used to identify events as steps or step instances. In someembodiments, each unique field value of a step ID field can beidentified as a separate step. In certain embodiments, a subset of thefield values of the step ID field can be identified as separate steps.For example, a step ID field may have twenty unique field values, butthe system may use fewer than the twenty unique field values to identifydifferent steps or step instances. As described herein, in some cases,the system can exclude certain field values of the step ID field for useas steps based on input received from a user or based on an analysis ofthe field values of the step ID field.

As described herein, in certain embodiments, the system can use multiplestep identifiers to categorize events and/or group events in a set ofevents into subsets of events. For example, as described above withreference to pivot identifiers, multiple step identifiers can be used togroup sets of events that come from multiple data sources into subsetsof events. For example, in some cases, the system can receive a stepidentifier for each data source. In this way, the system can identify afield in events from each data source to categorize the events from thedata source. In certain embodiments, one step identifier can be used formultiple data sources. For example, fields from different data sourcesused to categorize the events into steps can have the same or a similarfield identifier. In such embodiments, the step identifier can identifythe common field between the different data sources as the step IDfield.

Further, similar to the pivot identifiers, the system can receivemultiple step identifiers for a particular data source. In suchembodiments, the system can use the step identifiers to identify eventsthat are part of a nested set of events or nested journey instance. Forexample, events that are part of a nested set of events can include adifferent field that can be used to categorize them apart from the fieldused to categorize other steps that are part of the set of events.Accordingly, using a first step ID field to categorize events in the setof events and a second step ID field to categorize events in the nestedset of events, the system can identify the events in a journey instance,as well as the events in a nested journey instance.

In some cases, the system can group multiple events together as part ofthe same step. Thus, a subset of the events of a journey instance caninclude one or more events. For example, if the system determines thatmultiple events are related to a “purchase” action, the system can groupthe events together as part of a “purchase” step. In some cases, thesystem can determine that multiple events are part of the same stepbased on the one or more pivot ID fields, step ID fields, or timestamps.For example, the multiple events related to the “purchase” step may allhave the “purchase” as the field value for the step ID field, may allhave a field value for the pivot ID field that matches the other eventsin the journey instance, and/or may all have iterative timestamps (e.g.,no other events of the set of events fall between the events related tothe “purchase” action). However, the events grouped together as part ofthe “purchase” step may have a field value for a second pivot ID fieldthat matches each other. In this way, the system can identify the eventsas part of the journey instance and also group them together as part ofa subset of steps or a single step.

Further, in some cases, the system can determine that a particular stephas not occurred until a certain event(s) is observed. With reference tothe example above, the system can determine that a “purchase” action isnot complete until it receives three events with particular step IDs.Accordingly, the system can group the three events as a subset of eventsor a step instance.

At block 3708, the system identifies or builds a journey. The journeycan correspond to one or more journey instances. As described herein,the system can identify journey instances in a variety of ways.

In some cases, to identify a journey instance, the system identifies aset of events based on the one or more pivot identifiers, groups the setof events into one or more subsets of events based on the one or morestep identifiers, and orders the subset of events. In certain cases, thesystem identifies step instances or subsets of events from a set of databased on the one or more step identifiers, and then relates the stepinstances or subset of events based on the one or more pivotidentifiers. Accordingly, in certain embodiments, the pivotidentifier(s) are used to identify related events or set of events, andthe step identifier(s) are used to categorize the related events intostep instances or subsets of events.

In addition, as described herein the subset of events or step instancescan be ordered based on a timestamp or other information associated withthe events. The system can order the events before, after, orconcurrently with identifying the related events or sets of data andidentifying the step instances or subsets of events.

In some cases, the set of events can be based on the step identifier.For example, if an event includes a field value for a pivot ID field,but does not include a step ID field, field value for a step ID field,or includes an excluded field value for the step ID field, the systemcan exclude the event from the set of events.

As described herein, in some embodiments, events in a journey instanceinclude a common field value or have the same field value for a fieldassociated with or identified by a pivot identifier. Furthermore, whenmultiple journey instances are generated, each journey instance cancorrespond to a unique field value for the pivot ID field.

In certain embodiments, such as when multiple pivot identifiers areused, events in a journey instance can include at least one field valuefrom a group of related field values. Each of the field values in thegroup of related field values can be associated with a different pivotidentifier. In some cases, the system can use one or more gluing eventsto identify and form the group of related field values.

As described herein, in some instances, multiple events may correspondto a subset of events or a single step instance. For example, multipleevents may be generated for a single action, such as a purchase. Thesystem can identify the events generated for the single action and groupthem together as a subset of events or a step instance. In someembodiments, these related events may correspond to a nested journeyinstance.

As mentioned above, the system can categorize an event as any one of aplurality of steps or a step instance. In some cases, the system candetermine the number of steps for a set of data based on a fieldassociated with a step identifier. In some cases, each unique fieldvalue for the field associated with the step identifier can beidentified as a step. In certain cases, as described herein, a subset ofthe unique field values of the step ID field can be identified as astep. Based on the field value for the step ID field in the event, thesystem can identify an event or subset of events as a particular stepinstance.

As part of generating a journey instance, the system can identify anordering of the subset of events or step instances. In some cases, theordering can be based on a timestamp associated with each event or stepinstance. For example, the step instance with the earliest-in-timetimestamp can be identified as the first step instance in the journeyinstance and the step instance with the latest-in-time time stamp can beidentified as the last step instance in the journey instance, and so on.The ordered related events, ordered subset of events, or ordered stepsinstances can correspond to a journey instance.

Similarly, the system can identify a progression through the set ofevents, subset of events, or step instances based on the time stamp. Forexample, if a timestamp of Event1 is :33 and the timestamp of a Event2is :56, and there are no events in the set of events with a timestampbetween :33 and :56, the system can determine that the journey instanceprogressed from Event1 to Event2. However, if the timestamp of Event10is :45 (and no other events between :33 and :56), then the system candetermine that the journey instance progressed from Event1 to Event10 toEvent2.

In addition to journey instances, the system can also generate one ormore journeys. The journey can include ordered journeys or unorderedjourneys. An ordered journey can correspond to a certain number of stepsin a particular order, and an unordered journey can correspond to acertain number of steps without any particular order. Accordingly, insome embodiments, a journey instance can be an observation,representation, or an example of an ordered or unordered journey.

In some embodiments, the journeys can be built or generated based one ormore journey instances or one or more ordered subsets of events. Forexample, one or more journey instances that include the same steps andthe same order of steps can be combined to form an ordered journey.Similarly, journey instances that include the same steps but indifferent orders can be combined to form an unordered journey.Furthermore, in some cases, multiple journey instances with differentsteps and different orders of steps can be combined to form a journey.For example, the system can identify steps for a journey based on thedifferent step instances used to form the journey instances. The systemcan also identify journey instances that follow different paths throughthe steps of the journey model. The journey generated from the journeyinstances can show all of the different paths through the identifiedsteps of the journey. In such embodiments, the various journey instancesmay have different steps and different orders of those steps, however,each journey instance can traverse through at least one step of thejourney.

In certain embodiments, a journey can be built based on field values ofone or more step ID fields. For example, the system can identify one ormore field values of a step ID field as steps of an unordered journey.In some cases, the system can generate an ordered journey from theunordered journey based on one or more timestamps, one or more pivotidentifiers, and/or one or more journey instances or sets of events.

The system can use fewer, more, or different blocks as part of routine3700, or perform the blocks of routine 3700 in a different order orconcurrently. For example, the routine 3700 can include a block betweenblocks 3704 and 3706 for generating or building a set of events and/orinclude a block between blocks 3706 and 3708 for grouping the set ofevents into one or more subset of events. In certain embodiments, thesystem can generate one or more journeys without the one or more stepidentifiers. For example, based on the one or more pivot identifiers thesystem can identify related events, which can correspond to a journeyinstance. Further, in such embodiments, the system can order the eventsin the journey instance based on a timestamp associated with each eventof the journey instance.

In some embodiments, the system can generate one or more journeyswithout the one or more pivot identifiers. For example, based on the oneor more step identifiers the system can categorize the events of the setof data, which can correspond to a journey. Accordingly, based on theone or more pivot identifiers, the system can identify the steps of ajourney.

In certain embodiments, as part of routine 3700, the system can generateand display visualizations of the journeys. As mentioned, the journeyscan correspond to journey instances. Accordingly, the system cangenerate and display visualizations of flows associated with one or morejourney instances. Furthermore, the visualizations can identifyprogressions through the set of events, subset of events, journeyinstances, or journey.

FIG. 39 is a flow diagram illustrating an embodiment of a routine 3900implemented by one or more computing devices in a networked computerenvironment 100 for analyzing journey instances. For example, theroutine 3900 can be implemented by a client device 102, host device 104,and/or any one, or any combination, of the components of the data intakeand query system 108. However, for simplicity, reference below is madeto the system 108 performing the various steps of the routine 3900.

At block 3902, the system accesses journey instances. As describedherein, in some embodiments, each journey instance can include one ormore step instances, and each step instance can correspond to one ormore events of a set of data. The step instances of the journeyinstances or subsets of events can be ordered. Further, the journeyinstances can be generated based on one or more pivot identifiers, oneor more step identifiers, and/or one or more timestamps. The journeyinstances can be stored in memory or on disk. In some embodiments, toaccess the journey instances, the system can access a file thatidentifies particular events of a journey instance and an order of thoseparticular events. In certain embodiments, this information can bestored in a relational database. In some embodiments, the file caninclude an identifier for each of the particular events. In this way,the system can reduce the memory required to store the journeyinstances.

Further, in certain embodiments, the events of a particular journeyinstance can correspond to events from one or more data sources. Thedata sources can be heterogeneous data sources that have heterogeneousdata formats. In some embodiments, a journey instance can include anested journey instance. For example, as described herein, theoccurrence of one event can spawn one or more sub processes thatgenerate one or more events. The dependent events can be related to eachother as part of a nested journey instance and can be related to alarger or primary journey instance.

At block 3904, the system analyzes the plurality of journey instances togenerate a summary. In some embodiments, the summary can correspond to asingle journey instance or multiple journey instances. In certainembodiments, the summary can correspond to one or more journey or one ormore clusters of journey instances.

The summary can include various analytics about the journey instances orjourney. For example, as described herein, the summary can indicate thenumber of journey instances built from a set of data, the number ofevents in the set of data, the identity of steps in a journey, asequence of the step instances in the journey instances, a sequence ofsteps in a cluster of journey instances or ordered journey, a percentageof journey instances that represent or are an example of differentordered or unordered journeys, an indication of the frequency of stepsacross the different journey instances, an indication of the placementof the different steps across the different journey instances (e.g.,first, last, etc.), time limits of the set of data, a distribution ofthe lengths of the journey instances or number of events in thedifferent journey instances, average time of the journey instances,average time on each step of the journey instances, etc.

At block 3906, the system generates a visualization. In someembodiments, the visualization can correspond to one or more journeyinstances or one or more journey. In some embodiments, the visualizationcan correspond to multiple journey instances, or a cluster of journeyinstances, that include the same path through the same steps or anordered journey. In such cases, the journey instances can include stepinstances that correspond to the same steps of a journey and that havethe same order as an ordered journey.

In certain embodiments, the visualization can correspond to multiplejourney instances that have different paths through the same ordifferent steps. For example, the visualization can include all journeyinstances for a set of data or all different paths between steps of ajourney based on the set of data. In some cases, one group of thejourney instances may include one set of steps from the journey andanother group may include different steps, non-overlapping from thejourney.

In some embodiments, the visualization can include a numerical ornon-numerical indication of the number or percentage of journeyinstances that include a particular order of step instances or include aparticular passage between two or more step instances, or a particularpassage to or from a particular step or step instance. In some cases,the visualization can include lines or arrows between different stepsthat are traversed by a journey instance. In some cases the arrows orlines can be sized differently depending on the frequency or the numberof journey instances that include a particular passage between twosteps. For example, the visualization can include a larger or thickerarrow or line indicating a larger percentage or number of journeyinstances including a particular traversal compared to a smaller orthinner line or arrow. In some cases, the visualization can usedifferent colors to indicate the frequency or number of journeyinstances that include a particular traversal. In this way, thevisualization can facilitate the understanding of the topology of thesystem and/or the interactions between different data sources.

In some embodiments, the system can include information about eachjourney instance. For example, the visualization can identify fieldvalues for the different journey instances, or the field used as thepivot identifier. In certain cases, the visualization can identify aduration for each journey instance, a number of events in a particularjourney instance, and/or a sequence of events for a particular journeyinstance.

In certain embodiments, the visualization can include a summary of thejourney instances identified from a set of data, the number of eventsidentified from the set of data, the number of unique steps in the setof data, timing requirements used to generate the journey instances orprocess the set of data. In some embodiments, the visualization caninclude one or more graphics indicating a distribution of the number ofevents in the journey instances.

In certain embodiments, a user interface can include various controls tomodify the visualization. For example, the controls can enable a user tofilter journey instances based on a particular step, a particular orderor sequence of steps, particular transition between steps, a particularfirst step, a particular last step, etc. Furthermore, in someembodiments, the user interface can include various controls to viewvisualizations of clusters of journey instances, journey, or journeyinstances with the same steps and same sequence of steps, etc. In somecases, the user interface can include controls to modify thevisualization to identify one or more journeys derived from or builtbased on different journey instances.

In some embodiments, the visualization can include multiple nodes alongan arc, such as a circle, semi-circle, or half-moon. Some or all of thenodes can correspond to a step or step instance. In some embodiments,the nodes are ordered based on timestamps associated with thecorresponding step instance. For example, nodes corresponding to stepsthat are earliest in time for a journey instance or journey can becloser to an origin point (e.g., top, bottom, side, etc.) and nodeslater in time can be progressively closer to an end point and can belocated along an arc length between the origin point and end point. Incertain embodiments, the steps are ordered based on frequency oftransitions. For example, the first node can correspond to the node thatis most frequently the first node in a journey, the second node cancorrespond to the step that is most frequently traversed to from thefirst node, and so forth. In addition, the visualization can includeindications that identify transitions between the different nodes of thearc. In some implementations, the visualization may be manipulated bythe user, to allow the user to move, position, zoom, and/or focus onelements of the visualization, e.g., nodes and paths. In someimplementations, the visualization may include numeric representationsof data underlying the visualization, e.g., corresponding to journeymodels, journey instances, or data underlying the respective journeyinstances, individually or in aggregate.

The system can use fewer, more, or different blocks as part of routine3900, or perform the blocks of routine 3900 in a different order orconcurrently. Further, any of the steps described herein with referenceto routine 3900 can be combined with one or more steps described hereinwith reference to routines 37. For example, in some embodiments, theroutine 3900 can include receiving one or more pivot identifiers and/orone or more step identifiers, generating the journey instances andjourneys, etc.

3.2 Generating and Providing Journey Flow Visualizations

As described, various visualizations can be generated to provideinformation related to journeys. A journey flow is an example of avisualization that can provide various flow paths associated withjourney instances. In this regard, a set of journey instances associatedwith a journey can be represented as a journey flow via a journey flowvisualization. Generally, a journey flow visualization provides avisualization of various flow paths corresponding with journeyinstances. As such, a journey flow visualization provides arepresentation of the traversal of steps of a journey as indicated via aset of journey instances corresponding with the journey.

FIG. 40 is a diagram illustrating an embodiment of a journey flowvisualization 4000 that can be displayed in a display area or otherwiseincluded in the user interface or displayed. As described herein, thesystem 108 can generate a variety of journey visualizations to indicaterelationships between events and topologies. Accordingly, the journeyflow visualization 4000 represents one embodiment of the journeyvisualizations that can be generated by the system 108, and inparticular represents a journey flow visualization. A journey flowgenerally refers to a flow or path of any number of journey instancesthat individually describe a flow of steps within a journey.

In the illustrated embodiment, the journey flow visualization 4000indicates a relationship between an event/step/step instance with otherevents/steps/step instance of a set of journey instances. In this way,the journey flow visualization provides a flow of multiple journeysinstances, or stated differently, summarizes a set of journey instancesin relation to the step flow of the various journey instances.Advantageously, utilizing the journey flow visualization, as describedherein, enables a viewer to visualize an entire journey, including a setof journey instances, in a simple manner. In particular, utilizing aconventional system to view process flows having numerous steps can beunwieldy and difficult to view. For example, with numerous paths betweennodes, the paths or edges between the nodes can be difficult to view andanalyze. Embodiments of the present journey flow visualization, however,reduce noise and/or complexity of flow visualizations. Further, asdescribed herein, the journey flow visualization provides avisualization that appears to represent a reduced data set, while stillconveying information associated with a larger or entire data set.Accordingly, a viewer may be able to view an entire journey andrecognize or analyze various paths in the journey flow.

At a high-level, and in accordance with embodiments described herein,the journey flow visualization is organized to provide steps in adirectional order based on the shortest path to the start of thejourney. By way of example, a step nearest or closest to the start ofthe journey can be placed at the beginning (e.g., top) of the journeyflow, while a step closest to the end of the journey can be placed atthe end (e.g., bottom) of the journey flow. While generally describedherein as a journey flow organized from top to bottom, otherconfigurations are contemplated and within the scope of embodimentsdescribed herein. For instance, the directional order for placing stepsmay be from left to right, such that the step nearest or closest to thestart of the journey is placed at the left of the journey flow, and thestep closest to the end of the journey is placed on the right of thejourney flow. Using a directional order for laying out the steps of thejourney flow enables a user to view a general flow of the journey. Ascan be appreciated, in various journey instances, a step presented atthe beginning, or top, of the journey flow may occur later in a flow. Insuch a case, the step may be referenced via a loop. In this regard, anorder of steps associated with a particular journey instance may notimpact the layout of the journey flow.

With reference to journey flow visualization 4000, journey flowvisualization 4000 illustrates a journey flow for placing a food order.In this example, the journal flow visualization provides a simplejourney flow with steps 4002, 4004, 4006, 4008, 4010, and 4012. Node4002 represents the step of starting an order. Node 4004 represents thestep of adding a burger to the order. Node 4006 represents the step ofpaying for the order. Node 4008 represents the step of adding fries tothe order. Node 4010 represents the step of adding a drink to the order.Node 4012 represents the step of canceling the order. As describedabove, the steps included in the journey flow can be selected in anynumber of ways, such as, for example, based on a user selection of thesteps, a user selection of a pivot ID, a user selection of a stepidentifier, and/or the like.

As shown in FIG. 40 , the journey flow 4000 represents 1,000 journeyinstances that have occurred over the last two years. As can beappreciated, the order of steps in the journey can vary for variousjourney instances. For example, in one journey instance, a user maystart an order, place an order for a burger, place an order for a drink,and then pay for the order. In another journey instance, a user maystart an order, place an order for fries, cancel the order, place anorder for a burger, and then pay for the order. As shown, although thejourney flow visualization represents 1,000 journey instances, thejourney flow 4000 is illustrated in an efficient and effective manner.In contrast, separately illustrating the 1,000 journey instances havingvarious workflows among nodes would be challenging to understand andanalyze.

To emphasize a forward flow or traversal of steps, the forward flow pathcan be visually accentuated as compared to the backward flow path. Forexample, as shown in FIG. 40 , a forward flow path can the illustratedin a darker line or path color than a backward flow path. Forward flowpaths can be distinguished from backward flow paths in any other numberof ways, such as a color of the paths, a line width of the paths, a pathpattern, or the like. Visually emphasizing a forward flow path canenable a viewer to visualize the process flow in a forward direction ofthe flow.

A journey flow tool may be used (e.g., via the system 108) to generatejourney flow visualizations. In particular, and at a high-level, thejourney flow tool can determine placement for the nodes representingvarious steps in a journey and the visual link or edges representing thetransition, flow, or path between the steps. FIG. 41 is a flow diagramillustrating an embodiment of a routine 4100 implemented by one or morecomputing devices in a networked computer environment 100 for generatingjourney flow visualizations. For instance, the routine 4100 can beimplemented by a journey flow tool operating on a client device 102,host device 104, and/or any one, or a combination, of the components ofthe data intake and query system 108. However, for simplicity, referencebelow may be made to the system 108 and/or journey flow tool performingthe various steps of the routine 4100.

At block 4102, a set of journey instances for which to generate ajourney flow visualization are obtained. As can be appreciated, the setof journey instances may be referenced or dynamically generated.Generally, the set of journey instances correspond with a journey havinga set of steps. In some cases, the journey instances may traverse eachof the steps in the journey. In other cases, the journey instances maytraverse various steps (e.g., a subset of steps) in the journey. As canbe appreciated, the journey instances may traverse various combinationsand orders of steps associated with the journey.

At block 4104, a node layout is determined for the journey flowvisualization. In this regard, a placement or position for each node isdetermined. Nodes are generally used to represent various steps withinthe journey. For example, a first node can represent a first step of thejourney, and a second node can represent a second step of the journey.

Generally, in accordance with embodiments described herein, nodeplacement for each node is determined based on a shortest distance,among journey instances, from a step represented by the node to a startof the journey. In this regard, nodes can be placed or positioned withinflow levels or layers distributed from the start of the journey to theend of the journey, depending on the distance from the start. As such, anode representing a step having a short distance to the start of thejourney will be placed within a flow level closer to a start node than anode representing a step having a longer distance to the start of thejourney. A flow level generally refers to a level, which may berepresented via a row, horizontal extension, or y-axis coordinate,within the journey flow in which the nodes is positioned. Althoughgenerally described herein as stacking flow levels in a verticaldirection, in other embodiments, the flow levels may be stacked in otherdirections (e.g., horizontal direction) that flow from a start of thejourney to the end of the journey.

Within each flow level, an in-level position (e.g., x position orlateral position) can be determined for the node. An in-level positiongenerally refers to the position of a node within a flow level. In casesthat flow levels are positioned or stacked within a visualization fromtop to bottom, the flow levels extend in a lateral manner. As such, anx-position or lateral position can be determined for each node within aflow level. An in-level position can be determined in any number ofways. In one implementation, an in-level position for a particular nodecan be determined based on lateral positions of a node(s) in a higherlevel with which the particular node is associated. For instance, if aparticular node within a second flow level is associated with a firstnode and a second node in a first flow level, one level above theparticular node, the lateral position of the particular node can bedetermined based on the lateral position of the first node and thesecond node. In some cases, the lateral position may be weighted inaccordance with the journey instance paths. As such, assume more journeyinstances flow through the first node than the second node. In such acase, in determining a lateral position of the particular node, thelateral position associated with the first node may be weighted morethan the lateral position associated with the second node.

At block 4106, an edge layout is determined for the journey flowvisualization. In this regard, placement of edges or visual links,representing transitions between steps of the journey, are determined.Generally, an edge or visual link represents transitions between stepsof a journey. As such, placement of edges generally aligns with the flowof the journey between steps in accordance with the journey instances.In accordance with some embodiments described herein, for each node, theincoming edge placement connects with a particular edge of the node, andthe outgoing edge placement connects with another (e.g., opposite) edgeof the node. Such an edge placement consistency relative to the nodesenables the journey flow visualization to effectively illustrate ajourney flow. For example, in an implementation in which the nodes arepositioned in flow levels stacked from the top of the layout to thebottom of the layout, edges flowing to a node can connect with the topborder of the node and edges flowing from a node can connect with thebottom border of the node. Further, to simplify the journey flowvisualization, the edges can overlap where applicable. In this regard, asingle edge or visual link may be used to represent flow between twonodes. The edge may be generated to indicate a number of journeyinstances represented by the edge. For instance, the width or thicknessof the edge may be used to indicate a number of journey instancesrepresented by the edge.

At block 4108, the system generates a journey flow visualization. Asdescribed, the visualization can correspond to a set of journeyinstances. In some embodiments, the visualization can correspond tomultiple journey instances that have different paths through the same ordifferent steps. For example, the visualization can include all journeyinstances for a set of data. In some embodiments, the visualization caninclude a numerical or non-numerical indication of the number orpercentage of journey instances that include a particular order of stepinstances or include a particular passage between two or more stepinstances, or a particular passage to or from a particular step or stepinstance. As described, the visualization can include lines or arrowsbetween different steps that are traversed by a journey instance(s). Thearrows or lines can be sized differently depending on the frequency orthe number of journey instances that include a particular passagebetween two steps. For example, the visualization can include a largeror thicker arrow or line indicating a larger percentage or number ofjourney instances including a particular traversal compared to a smalleror thinner line or arrow. In some cases, the visualization can usedifferent colors to indicate the frequency or number of journeyinstances that include a particular traversal. In this way, thevisualization can facilitate the understanding of the topology of thesystem and/or the interactions between different data sources.

FIG. 42 is a flow diagram illustrating another embodiment of a routine4200 implemented by one or more computing devices in a networkedcomputer environment 100 for generating a journey flow visualization.For instance, the routine 4200 can be implemented by a journey flow tooloperating on a client device 102, host device 104, and/or any one, or acombination, of the components of the data intake and query system 108.However, for simplicity, reference below may be made to the system 108and/or a journey flow tool performing the various steps of the routine4200.

Initially, at block 4202, a set of journey instances for which togenerate a journey flow visualization are obtained. As can beappreciated, the set of journey instances may be referenced ordynamically generated. Generally, the set of journey instancescorrespond with a journey having a set of steps. In some cases, thejourney instances may traverse each of the steps in the journey. Inother cases, the journey instances may traverse various steps (e.g., asubset of steps) in the journey. As can be appreciated, the journeyinstances may traverse various combinations and orders of stepsassociated with the journey.

At block 4204, for each node that represents a step, a shortestdistance, among journey instances, from the corresponding step to thestart node is determined. In this regard, each journey instance can beanalyzed to identify a corresponding distance from a particular step toa journey start. The shortest of those distances can be identified ordesignated as the shortest distance for that particular step or node. Ashortest distance can be identified in relation to each node orcorresponding step.

A distance may be measured in any number of ways, such as a number ofincrements (or steps) to traverse from a journey start to a firstinstance of particular node representing a step in the journey. By wayof example only, assume a first sequence of a first journey instance isStart Node, Node A, Node B, Node C, Node D; a second sequence of asecond journey instance is Start Node, Node B, Node A, Node C, Node D;and a third sequence of a third journey instance is Start Node, Node C,Node B, Node D, Node A. In such a case, in analyzing the journeyinstances, for Node A, the shortest distance to the Start Node is 1. ForNode B, the shortest distance to the Start Node is 1. For Node C, theshortest distance to the Start Node is 1. For Node D, the shortestdistance to the Start Node is 3. Although the shortest distance isdetermined by the order of the steps in the various journey instances,other implementations may be used to determine a shortest distance. Forexample, in some cases, an amount of time may be used to determine ashortest distance to a journey start. In such a case, threshold timesmay be used to determine the flow level position in which to placenodes.

At block 4206, the shortest distance for each node is used to positionthe nodes within flow levels for the journey flow. In other words, theshortest distance from a particular step to a journey start is used todetermine a flow level, or distance from the start node, at which toposition a node representing with the particular step. As described,flow levels may be rows or horizontal extensions within the journey flowin which the nodes are positioned. Generally, the shorter the distancefrom a particular step to a journey start, the closer the noderepresenting the step is positioned in relation to the journey start.For instance, a node with a shortest distance of a 1-step amount to astart node may be vertically positioned in a first flow level (e.g.,row) below a start of the journey. A node with a shortest distance of a2-step amount to the start node may be vertically positioned in a secondflow level below a start of the journey. A node with a shortest distanceof 3-step amount to the start node may be vertically positioned in athird flow level below a start of the journey. By way of example only,and with brief reference to FIG. 40 , Node 4002 is positioned in a firstflow level below the start node 4020. Node 4004 is positioned in asecond flow level below the start node 4020. Nodes 4006, 4008, 4010, and4012 are positioned in a second flow level below the start node 4020.

As can be appreciated, the shortest distance can be used to place thenodes within flow levels in any number of ways. In some cases, anexplicit distance (e.g., step count) may be used to specify a flow levelfor a node. In other cases, a range of distances (e.g., step count1-step count 3) may be used to specify a flow level for a node. In othercases, the shortest distances can be used to dynamically determine aflow level for the nodes (e.g., using machine learning, based on thevariance of the shortest distances identified for each of thenodes/steps, etc.).

At block 4208, nodes within each flow level can be prioritized. In thisway, a priority for nodes within each flow level may be determined andassigned. A priority level or priority may be determined in any numberof ways. In some embodiments, a higher priority may be assigned to nodesthat connect with nodes in other flow levels. In contrast, a lowerpriority may be assigned to nodes that only connect with other nodes inthe same flow level. In such an implementation, the higher prioritynodes may be separated from the lower priority nodes. For example, thelower priority nodes (e.g., those that only connect with other nodes inthe same flow level) may be positioned on one side, or the outer edges,of the flow level. Alternatively, the lower priority nodes may bepositioned in another or a new flow level (e.g., below or above thecurrently designated flow level). As another example, nodes associatedwith a higher step count (e.g., exceeding a threshold) may beprioritized over nodes associated with a lower step count. As described,the prioritization may be used to determine placement of nodes withineach flow level.

At block 4210, for each node, an in-level position within the assignedflow level is determined. An in-level position refers to a positionwithin a flow level. In this way, in embodiments, a lateral position, orx-axis position, can be determined for a node within a flow level.Generally, an in-level position can be determined based on positions ofnodes in a higher flow level. In embodiments, for a particular node, oneor more nodes in a higher flow level connected to the particular nodecan be used to determine the in-level position. For instance, assume aparticular node in flow level 2 is connected to node A and node B inflow level 1. That is, in one or more journey instances, a flow pathtraverses from node A to the particular node and a flow path traversesfrom node B to the particular node. In this example, the in-levelposition of node A and node B can be used to determine an in-levelposition of the particular node. As one example, an average of thein-level positions may be determined and used as the in-level positionfor the particular node. As another example, a weighted average of thein-level positions for node A and node B may be determined and used asthe in-level position for the particular node. The weighted average maybe based on any number of attributes, such as, for instance, number ofjourney instances associated with the step or node (e.g., step count).

The in-level position can be designated in any number of ways. Forinstance, an x-coordinate may be used to specify an in-level position.As another example, an order of the nodes (e.g., from left to right)within a flow level can be used to specify an in-level position. As canbe appreciated, in some implementations, determining in-level positionsfor nodes may be performed in a sequential manner, for example,beginning with nodes in a highest flow level. In this way, in-levelpositions for nodes in a highest flow level can be determined and,thereafter, used to determine in-level positions for nodes in asubsequent flow level.

At block 4212, boundaries of the nodes can be designated for incomingedge placement and outgoing edge placement. Generally, in accordancewith embodiments described herein, a node boundary nearest a journeystart (e.g., top boundary) can be designated for incoming edgeplacement, and a node boundary nearest a journey end (e.g., bottomboundary) can be designated for outgoing edge placement. In this way,the journey flow appears in a directional manner that generally alignswith the process flow.

At block 4214, positions or placement for edges or visual links betweennodes are determined in accordance with the designated incoming andoutgoing edge placement boundaries. In one implementation, a mostdirect, or vertical, connection between nodes in different flow levels(e.g., sequential flow levels) may be determined as a primary edge.Other edges representing transitions between nodes can then flow intothat primary edge. This implementation can reduce the number of edges orvisual links that flow into or out of each node, thereby increasing thesimplicity of the journey flow visualization.

At block 4216, a journey flow visualization is generated in accordancewith the determined node and edge placements. The nodes and edges can berepresented in any number of ways. For instances, the nodes aregenerally illustrated herein in a rectangular shape, but any shape iswithin the scope of embodiments described herein. Further, the edges maybe emphasized in various manners to provide details, such as flowdirection, quantity of journey instances, or the like.

At block 4218, the journey flow visualization is caused to be displayed.For example, the journey flow visualization may be presented via a useror client device that requested to view a journey flow visualization.

FIGS. 43-46 provide additional examples of journey flow visualizations.In particular, FIG. 43 represents a journey flow visualization 4300 witha more extensive number of steps associated with a journey. FIG. 44provides an enlarged portion 4400 of the journey flow visualization 4300of FIG. 43 . In FIG. 44 , the enlarged portion 4400 is presented withjourney step count 4402 selected such that the journey step count isdetermined and presented in accordance with the nodes presented in thejourney flow visualization. Further, the nodes can be emphasized,colored, or otherwise formatted to visually convey the amount or extentof the journey step count. FIG. 45 illustrates the enlarged portion 4400of FIG. 44 with path average duration 4502 selected and applied. In thisregard, the average path duration is determined and presented inaccordance with edges presented in the journey flow visualization. FIG.46 illustrates the enlarged portion 4400 of FIG. 44 with path count 4602selected and applied. In particular, the path count is determined andpresented in accordance with edges presented in the journey flowvisualization.

Any or all of the features and functions described above can be combinedwith each other, except to the extent it may be otherwise stated aboveor to the extent that any such embodiments may be incompatible by virtueof their function or structure, as will be apparent to persons ofordinary skill in the art. Unless contrary to physical possibility, itis envisioned that (i) the methods/steps described herein may beperformed in any sequence and/or in any combination, and (ii) thecomponents of respective embodiments may be combined in any manner.

Although the subject matter has been described in language specific tostructural features and/or acts, it is to be understood that the subjectmatter defined in the appended claims is not necessarily limited to thespecific features or acts described above. Rather, the specific featuresand acts described above are disclosed as examples of implementing theclaims, and other equivalent features and acts are intended to be withinthe scope of the claims.

Conditional language, such as, among others, “can,” “could,” “might,” or“may,” unless specifically stated otherwise, or otherwise understoodwithin the context as used, is generally intended to convey that certainembodiments include, while other embodiments do not include, certainfeatures, elements and/or steps. Thus, such conditional language is notgenerally intended to imply that features, elements and/or steps are inany way required for one or more embodiments or that one or moreembodiments necessarily include logic for deciding, with or without userinput or prompting, whether these features, elements and/or steps areincluded or are to be performed in any particular embodiment.

Unless the context clearly requires otherwise, throughout thedescription and the claims, the words “comprise,” “comprising,” and thelike are to be construed in an inclusive sense, as opposed to anexclusive or exhaustive sense, i.e., in the sense of “including, but notlimited to.” As used herein, the terms “connected,” “coupled,” or anyvariant thereof means any connection or coupling, either direct orindirect, between two or more elements; the coupling or connectionbetween the elements can be physical, logical, or a combination thereof.Additionally, the words “herein,” “above,” “below,” and words of similarimport, when used in this application, refer to this application as awhole and not to any particular portions of this application. Where thecontext permits, words using the singular or plural number may alsoinclude the plural or singular number respectively. The word “or” inreference to a list of two or more items, covers all of the followinginterpretations of the word: any one of the items in the list, all ofthe items in the list, and any combination of the items in the list.Likewise the term “and/or” in reference to a list of two or more items,covers all of the following interpretations of the word: any one of theitems in the list, all of the items in the list, and any combination ofthe items in the list.

Conjunctive language such as the phrase “at least one of X, Y and Z,”unless specifically stated otherwise, is otherwise understood with thecontext as used in general to convey that an item, term, etc. may beeither X, Y or Z, or any combination thereof. Thus, such conjunctivelanguage is not generally intended to imply that certain embodimentsrequire at least one of X, at least one of Y and at least one of Z toeach be present. Further, use of the phrase “at least one of X, Y or Z”as used in general is to convey that an item, term, etc. may be eitherX, Y or Z, or any combination thereof.

In some embodiments, certain operations, acts, events, or functions ofany of the algorithms described herein can be performed in a differentsequence, can be added, merged, or left out altogether (e.g., not allare necessary for the practice of the algorithms). In certainembodiments, operations, acts, functions, or events can be performedconcurrently, e.g., through multi-threaded processing, interruptprocessing, or multiple processors or processor cores or on otherparallel architectures, rather than sequentially.

Systems and modules described herein may comprise software, firmware,hardware, or any combination(s) of software, firmware, or hardwaresuitable for the purposes described. Software and other modules mayreside and execute on servers, workstations, personal computers,computerized tablets, PDAs, and other computing devices suitable for thepurposes described herein. Software and other modules may be accessiblevia local computer memory, via a network, via a browser, or via othermeans suitable for the purposes described herein. Data structuresdescribed herein may comprise computer files, variables, programmingarrays, programming structures, or any electronic information storageschemes or methods, or any combinations thereof, suitable for thepurposes described herein. User interface elements described herein maycomprise elements from graphical user interfaces, interactive voiceresponse, command line interfaces, and other suitable interfaces.

Further, processing of the various components of the illustrated systemscan be distributed across multiple machines, networks, and othercomputing resources. Two or more components of a system can be combinedinto fewer components. Various components of the illustrated systems canbe implemented in one or more virtual machines, rather than in dedicatedcomputer hardware systems and/or computing devices. Likewise, the datarepositories shown can represent physical and/or logical data storage,including, e.g., storage area networks or other distributed storagesystems. Moreover, in some embodiments the connections between thecomponents shown represent possible paths of data flow, rather thanactual connections between hardware. While some examples of possibleconnections are shown, any of the subset of the components shown cancommunicate with any other subset of components in variousimplementations.

Embodiments are also described above with reference to flow chartillustrations and/or block diagrams of methods, apparatus (systems) andcomputer program products. Each block of the flow chart illustrationsand/or block diagrams, and combinations of blocks in the flow chartillustrations and/or block diagrams, may be implemented by computerprogram instructions. Such instructions may be provided to a processorof a general purpose computer, special purpose computer,specially-equipped computer (e.g., comprising a high-performancedatabase server, a graphics subsystem, etc.) or other programmable dataprocessing apparatus to produce a machine, such that the instructions,which execute via the processor(s) of the computer or other programmabledata processing apparatus, create means for implementing the actsspecified in the flow chart and/or block diagram block or blocks. Thesecomputer program instructions may also be stored in a non-transitorycomputer-readable memory that can direct a computer or otherprogrammable data processing apparatus to operate in a particularmanner, such that the instructions stored in the computer-readablememory produce an article of manufacture including instruction meanswhich implement the acts specified in the flow chart and/or blockdiagram block or blocks. The computer program instructions may also beloaded to a computing device or other programmable data processingapparatus to cause operations to be performed on the computing device orother programmable apparatus to produce a computer implemented processsuch that the instructions which execute on the computing device orother programmable apparatus provide steps for implementing the actsspecified in the flow chart and/or block diagram block or blocks.

Any patents and applications and other references noted above, includingany that may be listed in accompanying filing papers, are incorporatedherein by reference. Aspects of the invention can be modified, ifnecessary, to employ the systems, functions, and concepts of the variousreferences described above to provide yet further implementations of theinvention. These and other changes can be made to the invention in lightof the above Detailed Description. While the above description describescertain examples of the invention, and describes the best modecontemplated, no matter how detailed the above appears in text, theinvention can be practiced in many ways. Details of the system may varyconsiderably in its specific implementation, while still beingencompassed by the invention disclosed herein. As noted above,particular terminology used when describing certain features or aspectsof the invention should not be taken to imply that the terminology isbeing redefined herein to be restricted to any specific characteristics,features, or aspects of the invention with which that terminology isassociated. In general, the terms used in the following claims shouldnot be construed to limit the invention to the specific examplesdisclosed in the specification, unless the above Detailed Descriptionsection explicitly defines such terms. Accordingly, the actual scope ofthe invention encompasses not only the disclosed examples, but also allequivalent ways of practicing or implementing the invention under theclaims.

To reduce the number of claims, certain aspects of the invention arepresented below in certain claim forms, but the applicant contemplatesother aspects of the invention in any number of claim forms. Forexample, while only one aspect of the invention is recited as ameans-plus-function claim under 35 U.S.C sec. 112(f) (AIA), otheraspects may likewise be embodied as a means-plus-function claim, or inother forms, such as being embodied in a computer-readable medium. Anyclaims intended to be treated under 35 U.S.C. §112(f) will begin withthe words “means for,” but use of the term “for” in any other context isnot intended to invoke treatment under 35 U.S.C. §112(f). Accordingly,the applicant reserves the right to pursue additional claims afterfiling this application, in either this application or in a continuingapplication.

What is claimed is:
 1. A computer-implemented method comprising:accessing a set of events in a field-searchable data store, wherein eachevent includes a portion of raw machine data that reflects activity inan information technology environment and that is produced by acomponent of that information technology environment, wherein each eventis associated with a timestamp extracted from the raw machine dataassociated with that event; obtaining a set of journey instancesassociated with a journey having a set of steps, each step correspondingto one or more events of the set of events; generating a journey flowvisualization that represents flow paths for the set of journeyinstances, wherein generation of the journey flow visualizationcomprises: for each node representing a corresponding step of thejourney, determining a flow level based on a shortest distance among theset of journey instances between the corresponding step and a journeystart, for each node, determining an in-level position within the flowlevel based on positions of nodes in a higher flow level, and generatingedges to represent flow between pairs of nodes, wherein a single edge isgenerated to represent a plurality of journey instances occurringbetween a pair of nodes, and wherein a width of the single edge isdetermined based on a number of journey instances of the plurality ofjourney instances; and causing presentation, via a graphical userinterface, of the journey flow visualization to represent flow paths forthe set of journey instances, wherein the journey flow visualizationincludes the single edge to represent the plurality of journey instancesoccurring between the pair of nodes thereby providing a simplifiedvisualization that visually aggregates the plurality of journeyinstances occurring between the pair of nodes into a single edge tominimize a number of edges provided between the pair of nodes, whileconveying information associated with the set of journey instances suchthat the journey is presented in its entirety with forward flow pathsbetween steps visually distinguished from backward flow paths betweensteps to improve understanding of topology of a system associated withthe set of journey instances or interactions between different datasources of the system.
 2. The computer-implemented method of claim 1,wherein each journey instance represents an observed flow path of stepstaken in association with the journey.
 3. The computer-implementedmethod of claim 1, wherein a first journey instance represents anobserved flow path of a first set of steps taken in association with thejourney and a second journey instance represents an observed flow pathof a second set of steps taken in association with the journey.
 4. Thecomputer-implemented method of claim 1, wherein the set of journeyinstances are generated based on a user indication of the set of steps.5. The computer-implemented method of claim 1, wherein the journey flowvisualization comprises a set of flow levels that range from the journeystart to a journey end.
 6. The computer-implemented method of claim 1,wherein the journey flow visualization comprises a set of flow levelsthat range from the journey start to a journey end, and wherein stepsoccurring nearest to the journey start are positioned in a first flowlevel nearest the journey start.
 7. The computer-implemented method ofclaim 1, wherein the journey flow visualization comprises a set of flowlevels that range from the journey start to a journey end in a verticalmanner, and wherein a first flow level nearest the journey startcomprises at least one node representing a step from among the set ofsteps that occurs a shortest distance to the journey start.
 8. Thecomputer-implemented method of claim 1, wherein each flow level extendslaterally to position nodes within the flow level in a horizontalmanner.
 9. The computer-implemented method of claim 1 furthercomprising: determining a count of journey instances traversing througheach node, and presenting an indication of the count of journeyinstances in relation to a corresponding node.
 10. Thecomputer-implemented method of claim 1, wherein generation of thejourney flow visualization further comprises determining edge placementamong a set of nodes, wherein edge placement is optimized by combiningedges corresponding with a node at a point prior to connecting to thenode to have one aggregated edge connect to the node.
 11. Thecomputer-implemented method of claim 1, wherein the generation of thejourney flow visualization further comprises determining edge placementamong a set of nodes, wherein incoming edges connect to a top boundaryof a corresponding nodes and outgoing edges connect to a bottom boundaryof the corresponding nodes.
 12. The computer-implemented method of claim1, wherein the generation of the journey flow visualization furthercomprises determining edge placement among a set of nodes, wherein edgeplacement is optimized by identifying a most direct or verticalconnection between a first node in a first flow level and a second nodein a second flow level.
 13. A computing system, comprising: one or moreprocessing devices configured to: access a set of events in afield-searchable data store, wherein each event includes a portion ofraw machine data that reflects activity in an information technologyenvironment and that is produced by a component of that informationtechnology environment, wherein each event is associated with atimestamp extracted from the raw machine data associated with thatevent; obtain a set of journey instances associated with a journeyhaving a set of steps, each step corresponding to one or more events ofthe set of events; generate a journey flow visualization that representsflow paths for the set of journey instances, wherein generation of thejourney flow visualization comprises: for each node representing acorresponding step of the journey, determine a flow level based on ashortest distance among the set of journey instances between thecorresponding step and a journey start, for each node, determine anin-level position within the flow level based on positions of nodes in ahigher flow level, and generate edges to represent flow between pairs ofnodes, wherein a single edge is generated to represent a plurality ofjourney instances occurring between a pair of nodes, and wherein a widthof the single edge is determined based on a number of journey instancesof the plurality of journey instances; and cause presentation, via agraphical user interface, of the journey flow visualization to representflow paths for the set of journey instances, wherein the 7journey flowvisualization includes the single edge to represent the plurality ofjourney instances occurring between the pair of nodes thereby providinga simplified visualization that visually aggregates the plurality ofjourney instances occurring between the pair of nodes into a single edgeto minimize a number of edges provided between the pair of nodes, whileconveying information associated with the set of journey instances suchthat the journey is presented in its entirety with forward flow pathsbetween steps visually distinguished from backward flow paths betweensteps to improve understanding of topology of a system associated withthe set of journey instances or interactions between different datasources of the system.
 14. The computing system of claim 13, wherein afirst journey instance represents an observed flow path of a first setof steps taken in association with the journey and a second journeyinstance represents an observed flow path of a second set of steps takenin association with the journey.
 15. The computing system of claim 13,wherein the set of journey instances are generated based on a userindication of the set of steps.
 16. The computing system of claim 13,wherein the journey flow visualization comprises a set of flow levelsthat range from the journey start to a journey end, and wherein stepsoccurring nearest to the journey start are positioned in a first flowlevel nearest the journey start.
 17. The computing system of claim 13,wherein the journey flow visualization comprises a set of flow levelsthat range from the journey start to a journey end in a vertical manner,and wherein a first flow level nearest the journey start comprises atleast one node representing a step from among the set of steps thatoccurs a shortest distance to the journey start.
 18. The computingsystem of claim 13, wherein generation of the journey flow visualizationfurther comprises determining edge placement among a set of nodes,wherein edge placement is optimized to have one incoming edge relativeto each node and one outgoing edge relative to each node.
 19. Thecomputing system of claim 13, wherein generation of the journey flowvisualization further comprises determining edge placement among a setof nodes, wherein incoming edges connect to a top boundary of acorresponding nodes and outgoing edges connect to a bottom boundary ofthe corresponding nodes.
 20. The computing system of claim 13, whereingeneration of the journey flow visualization further comprisesdetermining edge placement among a set of nodes, wherein edge placementis optimized by identifying a most direct or vertical connection betweena first node in a first flow level and a second node in a second flowlevel.
 21. Non-transitory computer readable media comprisingcomputer-executable instructions that, when executed by a computingsystem, cause the computing system to: access a set of events in afield-searchable data store, wherein each event includes a portion ofraw machine data that reflects activity in an information technologyenvironment and that is produced by a component of that informationtechnology environment, wherein each event is associated with atimestamp extracted from the raw machine data associated with thatevent; obtain a set of journey instances associated with a journeyhaving a set of steps, each step corresponding to one or more events ofthe set of events; generate a journey flow visualization that representsflow paths for the set of journey instances, wherein generation of thejourney flow visualization comprises: for each node representing acorresponding step of the journey, determine a flow level based on ashortest distance among the set of journey instances between thecorresponding step and a journey start, for each node, determine anin-level position within the flow level based on positions of nodes in ahigher flow level, and generate edges to represent flow between pairs ofnodes, wherein a single edge is generated to represent a plurality ofjourney instances occurring between a pair of nodes, and wherein a widthof the single edge is determined based on a number of journey instancesof the plurality of journey instances; and cause presentation, via agraphical user interface, of the journey flow visualization to representflow paths for the set of journey instances, wherein the journey flowvisualization includes the single edge to represent the plurality ofjourney instances occurring between the pair of nodes thereby providinga simplified visualization that visually aggregates the plurality ofjourney instances occurring between the pair of nodes into a single edgeto minimize a number of edges provided between the pair of nodes, whileconveying information associated with the set of journey instances suchthat the journey is presented in its entirety with forward flow pathsbetween steps visually distinguished from backward flow paths betweensteps to improve understanding of topology of a system associated withthe set of journey instances or interactions between different datasources of the system.
 22. The non-transitory computer readable media ofclaim 21, wherein each journey instance represents an observed flow pathof steps taken in association with the journey.
 23. The non-transitorycomputer readable media of claim 21, wherein a first journey instancerepresents an observed flow path of a first set of steps taken inassociation with the journey and a second journey instance represents anobserved flow path of a second set of steps taken in association withthe journey.
 24. The non-transitory computer readable of claim 21,wherein the set of journey instances are generated based on a userindication of the set of steps.
 25. The non-transitory computer readablemedia of claim 21, wherein the journey flow visualization comprises aset of flow levels that range from the journey start to a journey end.26. The non-transitory computer readable media of claim 21, wherein thejourney flow visualization comprises a set of flow levels that rangefrom the journey start to a journey end, and wherein steps occurringnearest to the journey start are positioned in a first flow levelnearest the journey start.
 27. The non-transitory computer readablemedia of claim 21, wherein the journey flow visualization comprises aset of flow levels that range from the journey start to a journey end ina vertical manner, and wherein a first flow level nearest the journeystart comprises at least one node representing a step from among the setof steps that occurs a shortest distance to the journey start.
 28. Thenon-transitory computer readable media of claim 21 further comprising:determining a count of journey instances traversing through each node,and presenting an indication of the count of journey instances inrelation to the corresponding node.
 29. The non-transitory computerreadable media of claim 21, wherein generation of the journey flowvisualization further comprises determining edge placement among a setof nodes, wherein edge placement is optimized by combining edgescorresponding with a node at a point prior to connecting to the node tohave one aggregated edge connect to the node.
 30. Thecomputer-implemented method of claim 1 further comprising: determiningan average path duration associated with the plurality of journeyinstances occurring between the pair of nodes; and causing presentationof the average path duration adjacent to the single edge representingthe plurality of journey instances occurring between the pair of nodes.